#include<bits/stdc++.h>

using namespace std;

int m,n,k;

int arr[];

int main()

{

    stack<int>st;

    scanf("%d %d %d", &m, &n, &k);

    int i;

    while (k--)

    {

        bool flag = true;

        int current = ;

        for (i = ; i <= n; i++)

        {

            scanf("%d", &arr[i]);

        }

        while (!st.empty())

        {

            st.pop();

        }

        for (i = ;i<=n; i++)

        {

            st.push(i);

            if (st.size()>m)

            {

                flag = false;

                break;

            }

            while (current <= n&&st.size()>&&st.top() == arr[current])

            {

                st.pop();

                current++;

            }

        }

        if (st.size() ==  && flag == true)

        {

            printf("YES\n");

        }

        else

            printf("NO\n");

    }

}