方师解

#include<bits/stdc++.h>
using namespace std;
void solve()
{
    long long n,k,x,last;
    bool flag = true;
    cin >> n >> k >> last;
    for(int i = 2 ; i <= n ; i ++ ){
        cin >> x;
        if(last > x)flag = false;
        last = x;
    }
    if(flag){
        cout << "YES" << endl;
        return ;
    }
    if(k>1)cout << "YES" << endl;
    else cout << "NO" << endl;
}

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}