#include<bits/stdc++.h>
#define rep(i, s, t) for(int i = (s); i <= (t); i ++)
#define per(i, s, t) for(int i = (s); i >= (t); i --)
#define fio(x) freopen(#x".in", "r", stdin); freopen(#x".out", "w", stdout);
using namespace std;
typedef long long ll;

const int N = 15;
set<vector<int>> s;

void dfs(vector<int> now)
{
    if(now.empty()) return;
    if(s.count(now)) return;
    s.insert(now);
    int mx = 0;
    rep(i, 0, now.size() - 1)
    {
        if(now[i] > mx)
        {
            mx = now[i];
            auto tmp = now;
            if(mx > 1) tmp.push_back(mx - 1);
            tmp = vector<int>(tmp.begin() + i + 1, tmp.end());
            dfs(tmp);
        }
    }
}

void solve()
{
    int n, m; cin >> n >> m;
    vector<int> v(n);
    rep(i, 0, n - 1) cin >> v[i];
    s.clear();
    dfs(v);
    cout << s.size() << "\n";
}

signed main()
{
    fio(seal);
    ios::sync_with_stdio(0);cin.tie(0);
    int _, t; cin >> _ >> t; while(t --) solve();

    return 0;
}