#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=40010;
int t,n,k,sum,ans,tp,t1,t2,t3;
int f,c[N],w[N];
LL as;
struct node{
	int lc,rc;
}tr[N];
void fnd(int a,int &t1,int &t2){
	if(tr[a].lc){
		if(w[a]!=w[tr[a].lc]){
			t1=w[a],t2=w[tr[a].lc];
			return ;
		}
		fnd(tr[a].lc,t1,t2);
	}
	if(tr[a].rc){
		if(w[a]!=w[tr[a].rc]){
			t1=w[a],t2=w[tr[a].rc];
			return ;
		}
		fnd(tr[a].rc,t1,t2);
	}
}
void dfs(int a,int s){
	if(tr[a].lc){
		if((w[tr[a].lc]+s)%(w[a]+s)){
			f=0;
			return ;
		}
		dfs(tr[a].lc,s);
	}
	if(tr[a].rc){
		if((w[tr[a].rc]+s)%(w[a]+s)){
			f=0;
			return ;
		}
		dfs(tr[a].rc,s);
	}
}
void check(int s){
	f=1;
	dfs(tr[0].rc,s);
	if(f)ans++,as+=s;
}
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&k);
		for(int i=1;i<=n;i++){
			scanf("%d",&w[i]);
		}
		if(n==1){
			printf("%d %d\n",k,1ll*k*(k+1)/2);
			continue;
		}
		ans=as=sum=tp=t1=t2=0;
		for(int i=1,k;i<=n;i++){
			k=0;
			while(tp&&w[i]<w[c[tp]])k=c[tp],tp--;
			tr[c[tp]].rc=i,tr[i].lc=k;
			c[++tp]=i;
		}
		fnd(tr[0].rc,t1,t2);
		if(t1==0&&t2==0){
			printf("%d %d\n",k,1ll*k*(k+1)/2);
			continue;
		}
		t3=abs(t1-t2),t1=min(t1,t2);
		for(int i=1;i*i<=t3;i++){
			if(t3%i)continue;
			if(i-t1>0&&i-t1<=k)check(i-t1);
			if(i!=t3/i&&t3/i-t1>0&&t3/i-t1<=k)check(t3/i-t1);
		}
		printf("%d %lld\n",ans,as);
	}
	return 0;
}