Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, …, N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if M is 5 and N is 7, we can obtain 1, 2, 3, 4, 5, 6, 7 from the stack, but not 3, 2, 1, 7, 5, 6, 4.

輸入描述:
Each input file contains one test case. For each case, the first line contains 3 numbers (all no more than 1000): M (the maximum capacity of the stack), N (the length of push sequence), and K (the number of pop sequences to be checked). Then K lines follow, each contains a pop sequence of N numbers. All the numbers in a line are separated by a space.

輸出描述:
For each pop sequence, print in one line “YES” if it is indeed a possible pop sequence of the stack, or “NO” if not.

輸入例子:
5 7 5
1 2 3 4 5 6 7
3 2 1 7 5 6 4
7 6 5 4 3 2 1
5 6 4 3 7 2 1
1 7 6 5 4 3 2

輸出例子:
YES
NO
NO
YES
NO

#include<bits/stdc++.h>
#include <iostream> 
#include <map>
#include <string>
#include<vector>
#include<stack> 
using namespace std;	


int main()
{
int m,n,k;
cin>>m>>n>>k;
for(int i=0;i<k;i++)
{
	int a[n];
	for(int j=0;j<n;j++)
	cin>>a[j];
	
	stack<int> sta;
	int cnt=0,flag=1;
	
	for(int j=1;j<=n;j++)
	{
		sta.push(j);
		if(sta.size()>m)
		{
			flag=0;
			break;
		 } 
		 
		 while(!sta.empty()&&sta.top()==a[cnt])
		 {
		 	cnt++;
		 	sta.pop();
		 }
	}
	if(flag&&sta.empty())cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
}

		return 0;
 }