#define _CRT_SECURE_NO_WARNINGS
#include<cstring>
#include<iostream>
#include<algorithm>
#include<sstream>
#include<string>
#include<vector>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<fstream>
#include<cassert>
#include<numeric>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<deque>
#define INF 987654321
using namespace std;

void solve1(vector<int>& weapon, map<int,int>& cache, list<int>& picked, int K, int idx, int flag, int& ret){
    /*
    list<int>::iterator it;
    cout << "PICKED : ";
    for (it = picked.begin(); it != picked.end(); it++){
        cout << *it << " ";
    }
    if (cache.size() == K){ cout << "ret++"; }
    cout << endl;
    */
        int N = weapon.size();

        if (idx >= N){ return; }
        if (picked.size() <= 0){ return; }

        if (cache.size() < K){ return; }

        if (cache.size() == K){
            ret++;
            int backup = picked.front();
            cache[backup]--;
            if (cache[backup] <= 0){ cache.erase(backup); }
            picked.pop_front();
            solve1(weapon, cache, picked, K, idx, -1, ret);
            picked.push_front(backup);
            cache[backup]++;

            if (flag != -1){
                if (idx + 1 < N){
                    int val = weapon[idx + 1];
                    cache[val]++;
                    picked.push_back(val);
                    solve1(weapon, cache, picked, K, idx + 1, 0, ret);
                }
            }
        }

        if (cache.size() > K){
            int front = picked.front();
            cache[front]--;
            if (cache[front] <= 0){ cache.erase(front); }
            picked.pop_front();
            solve1(weapon, cache, picked, K, idx, 0, ret);
        }

}
int solve2(vector<int>& weapon, int N, int K){
        int ret = 0;
        if (N < K){ return 0; }
        if (K == 0){ return 0; }
        map<int, int> cache;
        list<int> picked;
        int idx = -1;
        for (int i = 0; i < N; i++){
            int val = weapon[i];
            cache[val]++;
            picked.push_back(val);
            if (cache.size() == K){ idx = i; break; }
        }
        if (idx == -1){ return 0; }
        solve1(weapon, cache, picked, K, idx, 0, ret);
        return ret;

}
int main(){
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while (T--){
        int N, K;
        cin >> N >> K;
        vector<int> weapon;
        for (int i = 0; i < N; i++){
            int buf;
            cin >> buf;
            weapon.push_back(buf);
        }
        cout << solve2(weapon, N, K) << endl;
    }
    system("pause");
}