DSA01023 - SỐ THỨ TỰ TỔ HỢP

//Made By Phuong Nam PROPTIT <3//
#pragma GCC Optimize("O3")
#include<bits/stdc++.h>
#include<string>
#include<vector>
#define alphaa "abcdefghijklmnopqrstuvwxyz"
#define ALPHAA "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define f(i,a,b) for(int i=a;i<=b;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define f0(i,n) for(int i=0;i<n;i++)
#define ff(i,b,a) for(int i=b;i>=a;i--)
#define el cout<<'\n'
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(s) s.begin(),s.end()
using namespace std;
typedef long long ll;
const int N=1e6+3;
const int MOD=1e9+7;
template<class X,class Y>
    void minimize(X &x,const Y &y) {
        if (x>y) x=y;
    }
template<class X,class Y>
    void maximize(X &x,const Y &y) {
        if (x<y) x=y;
    }
template<class T>
    T Abs(const T &x) {
        return (x<0?-x:x);
    }
int a[12],n,k,b[12],kt=1;
vector<vi> v;
bool check(vi v)
{
    f0(i,v.size())
    {
        if(b[i+1]!=v[i]) return 0;
    }
    return 1;
}
void sinh()
{
    vi res;
    f1(i,k) res.pb(a[i]);
    v.pb(res);
    int i=k;
    while(i&&a[i]==n-k+i) i--;
    if(i)
    {
        a[i]++;
        f(j,i+1,k) a[j]=a[j-1]+1;
    }
    else return kt=0,void();
}
void xuly()
{
   v.clear();
   cin>>n>>k;
   f1(i,k) cin>>b[i];
   f1(i,k) a[i]=i;
   kt=1;
   while(kt) sinh();
   sort(all(v));
   f0(i,v.size())
   {
       if(check(v[i])) return cout<<i+1<<'\n',void();
   }
}
int main()
{
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int t=1;
  cin>>t;
  while(t--) xuly();
  return 0;
}
//-----YEU CODE HON CRUSH-----//