Pop Sequence (25)

import java.io.PrintStream;
import java.util.Scanner;
import java.util.Stack;

public class Main {
	public static PrintStream out = System.out;
	public static Scanner in = new Scanner(System.in);

	public void popSequenceTest(String[] seq, int n, int capacity) {
		int[] array = new int[n];
		for(int i=0;i<n;++i){
			array[i] = Integer.valueOf(seq[i]);
		}
		
		Stack<Integer> stack = new Stack<>();
		int i,j,index = 0;
		
		for(i=0;i<n;++i){
			// 需要入栈
			if(array[i]>index){
				for(j=index+1;j<=array[i];++j){
					stack.push(j);
					// 栈溢出
					if(stack.size()>capacity){
						out.println("NO");
						return;
					}
				}
				index = array[i];
			}
			// 出栈异常
			if(stack.empty()){
				out.println("NO");
				return;
			}
			// 出栈正常
			int val = stack.pop();
			if(val != array[i]){
				// 输出的待验证的序列错误
				out.println("NO");
				return;
			}
		}
		
		out.println("YES");
	}

	public void test() {
		int M, N, K;
		M = in.nextInt();
		N = in.nextInt();
		K = in.nextInt();
		in.nextLine(); // 读取空白行

		for (int i = 1; i <= K; ++i) {
			String[] seq = in.nextLine().split(" ");
			popSequenceTest(seq, N, M);
		}
	}

	public static void main(String[] args) {
		Main m = new Main();
		m.test();
	}

}