#include<stdio.h>#include<stack>
using namespace std;constint maxn =1010;int sqe[maxn];intmain(){int N, M, K;
stack<int> st;scanf("%d%d%d",&N,&M,&K);while(K--){while(!st.empty()){
st.pop();}for(int i =1; i <= N; i++){scanf("%d",&sqe[i]);}int cur_idx =1;
bool flag = true;// 合法标志for(int i =1; i <= N; i++){
st.push(i);if(st.size()> M){
flag = false;break;// 不合法,则跳出本次循环}if(!st.empty()&& st.top()== sqe[cur_idx])// 注意,top() 和 pop() 都需要判断是否为空{
st.pop();
cur_idx++;}}if(st.empty()&& flag == true){printf("Yes\n");}else{printf("No\n");}}getchar();getchar();return0;}