CATFEED#2

#include<bits/stdc++.h>

using namespace std;

const int MX = (1<<18);

int T , n , m;

int arr[1<<18];
int main(){

    cin>>T;

    while(T--){
        cin>>n>>m;
        bool notok = 0;
        int x;
        for(int j = 1 ; j <= m ; j++)
            cin>>arr[j];
        for(int j = 1 ; j <= m ; j+=n){
            vector < int > v;
            for(int i = j ; i < min(m + 1 , j + n) ; i++)
                v.push_back(arr[i]);
            sort(v.begin() , v.end());
            for(int i = 1 ; i < v.size() ; i++)
                notok |= (v[i] == v[i-1]);
        }
        if(notok) puts("NO");
        else puts("YES");
    }





}