a=int(input())
for i in range(a):
b=list(map(int,input().split()))
c=list(map(int,input().split()))
N=b[0]
K=b[1]
if K==1:
print((N-1)//2)
else:
sum=0
for j in range(1,N-1):
if c[j]>c[j-1]+c[j+1]:
sum+=1
print(sum)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b,c,d,e,ee,p[200005];
int main(){
scanf("%lld",&a);
while(a--){
d=0;
ee=0;
scanf("%lld%lld",&b,&c);
for(int i=1;i<=b;i++){
scanf("%lld",&p[i]);
}
for(int i=2;i<=b-1;i++){
if(p[i]>p[i-1]+p[i+1]){
d++;
}
}
if(c==1){
if(b%2==1)
printf("%lld\n",b/2);
else
printf("%lld\n",b/2-1);
}else
printf("%lld\n",d);
}
}
1611B - Team Composition Programmers and Mathematicians | 110A - Nearly Lucky Number |
1220B - Multiplication Table | 1644A - Doors and Keys |
1644B - Anti-Fibonacci Permutation | 1610A - Anti Light's Cell Guessing |
349B - Color the Fence | 144A - Arrival of the General |
1106A - Lunar New Year and Cross Counting | 58A - Chat room |
230A - Dragons | 200B - Drinks |
13A - Numbers | 129A - Cookies |
1367B - Even Array | 136A - Presents |
1450A - Avoid Trygub | 327A - Flipping Game |
411A - Password Check | 1520C - Not Adjacent Matrix |
1538B - Friends and Candies | 580A - Kefa and First Steps |
1038B - Non-Coprime Partition | 43A - Football |
50A - Domino piling | 479A - Expression |
1480A - Yet Another String Game | 1216C - White Sheet |
1648A - Weird Sum | 427A - Police Recruits |