//GZ-012 ����ʡ֯������ѧУ 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2505;
int caseid, T;
int ans, n, m, a[maxn];
map<vector<int>, bool> mp;
void dfs(vector<int> s) {
    if (mp.find(s) != mp.end() || s.empty()) return ;
    mp[s] = true;
    ans++;
    int v = -1;
    for (int i = 0; i < s.size(); ++i) {
        if (s[i] > v) {
            vector<int> f;
            f.clear();
            for (int j = i + 1; j < s.size(); ++j)
                f.push_back(s[j]);
            if (s[i] != 1) f.push_back(s[i] - 1);
            dfs(f);
        }
        v = max(v, s[i]);
    }
}
void solve() {
    scanf("%d%d", &n, &m);
    ans = 0;
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    mp.clear();
    vector<int> s; s.clear();
    for (int i = 1; i <= n; ++i) s.push_back(a[i]);
    dfs(s);
    printf("%d\n", ans);
}
int main() {
    freopen("seal.in", "r", stdin);
    freopen("seal.out", "w", stdout);
    scanf("%d%d", &caseid, &T);
    while (T--) solve();
    return 0;
}