#include<iostream>
#include<vector>
#include<algorithm>
using std::cin,std::cout;
int n,k,b[50010],ls[50010],rs[50010];
int s[50010],*tp=s;
void solve(){
	cin>>n>>k;
	for(int i=1;i<=n;i++) cin>>b[i];
	if(std::all_of(b+1,b+n+1,[](int x){return x==b[1];})){
		cout<<k<<' '<<(k+1ll)*k/2<<'\n';
		return;
	}
	b[0]=-1;
	*tp=0;
	for(int i=1;i<=n;i++){
	    while(b[*tp]>=b[i])ls[i]=*tp--;
	    if(tp!=s)rs[*tp]=i;
	    *++tp=i;
	}
	std::vector<int> xs;
	for(int i=1;i<=n;i++){
		int x=0;
		if(ls[i]&&b[ls[i]]!=b[i]) x=ls[i];
		if(rs[i]&&b[rs[i]]!=b[i]) x=rs[i];
		if(x){
			int u=b[x]-b[i];
			for(int r=1;r*r<=u;r++)if(u%r==0){
				if(r-b[i]<=k&&b[i]<r) xs.push_back(r-b[i]);
				if(u/r-b[i]<=k&&b[i]<u/r) xs.push_back(u/r-b[i]);
			}
			break;
		}
	}
	int ans1=0;
	long long ans2=0;
	for(auto x:xs){
		int book=1;
		for(int i=1;book&&i<=n;i++){
			if(ls[i]&&(b[ls[i]]-b[i])%(b[i]+x)!=0) book=0;
			if(rs[i]&&(b[rs[i]]-b[i])%(b[i]+x)!=0) book=0;
		}
		if(book) ans1++,ans2+=x;
	}
	cout<<ans1<<' '<<ans2<<'\n';
}
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int T;
	cin>>T;
	while(T--) solve();
	return 0;
}