#include<bits/stdc++.h>usingnamespace std;typedeflonglong ll;typedef pair<int,int>PII;constint MOD =998244353;constint N =2e5+10;int dx[]={0,0,1,-1};int dy[]={1,-1,0,0};int t;
ll a[N], s[N], res[N];intmain(){
cin >> t;while(t --){int n, k;
cin >> n >> k;for(int i =1; i <= n; i ++) cin >> a[i];for(int i =1; i <= n -1; i ++){if(a[i]>= a[i +1]*2){
res[i]=1;}
s[i]= s[i -1]+ res[i];}int j =0, cnt =0;for(int i = k +1; i <= n; i ++){if(s[i -1]- s[j]==0) cnt ++;
j ++;}
cout << cnt << endl;for(int i =1; i <= n; i ++){
s[i]=0;
res[i]=0;}}}