#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int gcd(int x,int y){
	return y?gcd(y,x%y):x;
}
int abs(int x){
	return x>0?x:-x;
}
int n,k,a[100001],g[100001];
int ls[100001],rs[100001];
int stk[100001],top,sz[100001];
void upd(int &g,int p){
	if(p==-1)return;
	if(g==-1)g=p;
	else g=gcd(g,p);
}
void dfs(int x){
	g[x]=-1;
	if(ls[x]){
		dfs(ls[x]);
		upd(g[x],g[ls[x]]);
		upd(g[x],abs(a[x]-a[x-1]));
	}
	if(rs[x]){
		dfs(rs[x]);
		upd(g[x],g[rs[x]]);
		upd(g[x],abs(a[x+1]-a[x]));
	}
}
bool check(int x){
	if(x>k||x<=0)return 0;
	int i;
	for(i=1;i<=n;i++)if(g[i]!=-1&&g[i]%(a[i]+x))return 0;
	return 1;
}
void solve(){
	int i,j;
	scanf("%d%d",&n,&k);
	top=0;
	for(i=0;i<=n;i++)ls[i]=rs[i]=stk[i]=0;
	for(i=1;i<=n;i++){
		scanf("%d",&a[i]);
		while(top&&a[stk[top]]>a[i])top--;
		ls[i]=rs[stk[top]];
		rs[stk[top]]=i;
		stk[++top]=i;
	}
	int rt=stk[1];
	dfs(rt);
	if(g[rt]<=0){
		printf("%d %lld\n",k,1ll*k*(k+1)/2);
		return;
	}
	long long res=0;
	int cnt=0;
	for(i=a[rt];i*i<=g[rt];i++){
		if(g[rt]%i)continue;
		int v=g[rt]/i;
		if(check(i-a[rt]))res+=i-a[rt],cnt++;
		if(v!=i&&check(v-a[rt]))res+=v-a[rt],cnt++;
	}
	printf("%d %lld\n",cnt,res);
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--)solve();
}