#include<iostream>
#include<stack>
using namespace std;
stack<int>q;
int m, k, n;
int main()
{
    scanf("%d%d%d", &m, &n, &k);
    while (k--)
    {
        while (!q.empty())q.pop();
        int a[1010];
        bool f = true;
        for (int i = 0; i<n; i++)
        {
            scanf("%d", &a[i]);
        }
        int now = 1, i = 0;
        while (i<n)
        {
            while (now <= a[i] && q.size()<m)q.push(now++);
            if (q.empty())break;
            int v = q.top();
            q.pop();
            if (v != a[i])
            {
                f = false;
                break;
            }
            i++;
        }
        if (f)printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}