#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define FI ios_base::sync_with_stdio(false); cin.tie(NULL);
#define PREC cout << setprecision(10) << fixed;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class T> struct cmp {
bool operator() (T x, T y) {
return x.first < y.first;
}
};
template <class T> using ordered_set = tree<T, null_type, cmp<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
const int MOD = 1e9 + 7;
const int INF = 1e9 + 9;
const int MX = 1e5 + 5;
bool isPrime[MX];
void sieve() {
memset(isPrime, true, sizeof isPrime);
isPrime[0] = isPrime[1] = false;
for(int i=2;i*i<MX;i++) {
if(isPrime[i] == false) continue;
for(int j=i*i;j<MX;j+=i) {
isPrime[j] = false;
}
}
}
int n, k;
int inp[MX];
#undef int
int main() {
#define int long long
FI;
sieve();
int tt;
cin >> tt;
while(tt--) {
cin >> n >> k;
for(int i=0;i<n;i++) {
cin >> inp[i];
}
ordered_set<pair<int,int> > st;
int ans = 0;
int sum = 0;
for(int i=0;i<k;i++) {
st.insert({inp[i],i});
sum += inp[i];
}
int avg = sum/k;
auto it = st.find_by_order((k-1) /2);
assert(it != st.end());
int med = it->first;
assert(avg >= 0 && med >= 0);
if(isPrime[avg] == isPrime[med] && avg >= med) ans++;
for(int i=k;i<n;i++) {
sum += inp[i] - inp[i-k];
st.erase({inp[i-k], i-k});
st.insert({inp[i], i});
avg = sum/k;
it = st.find_by_order((k-1) /2);
assert(it != st.end());
med = it->first;
assert(avg >= 0 && med >= 0);
if(isPrime[avg] == isPrime[med] && avg >= med) ans++;
}
cout << ans << endl;
}
return 0;
}