#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=5e4+2e2;
using pll=pair<ll,ll>;

void solve(){
	ll n,k;
	cin>>n>>k;
	vector<ll>b(N,0),ls(N,0),rs(N,0);
	ll root=0;
	for(int i=1;i<=n;i++){
		cin>>b[i];
	}
	vector<ll>sk;
	while(sk.size())sk.pop_back();
	sk.push_back(0);
	sk.push_back(1);
	for(int i=2;i<=n;i++){
		while(sk.size()){
			ll x=sk.back();
			if(x==0){
				sk.push_back(i);
				break;
			}
			if(b[i]<b[x]){
				rs[x]=ls[i];
				ls[i]=x;
				sk.pop_back();
			}else{
				rs[x]=i;
				sk.push_back(i);
				break;
			}
		}
		
	}
	root=sk[1];
//		for(int i=1;i<=n;i++)cout<<ls[i]<<'y'<<rs[i]<<'\n';		
	set<pll>st;
	for(int i=1;i<=n;i++){
		if(ls[i]&&b[ls[i]]-b[i]>0)st.insert({b[ls[i]]-b[i],b[i]});
		if(rs[i]&&b[rs[i]]-b[i]>0)st.insert({b[rs[i]]-b[i],b[i]});
	}
	
	if(st.empty()){
		cout<<k<<' '<<1ll*k*(k+1)/2<<'\n';
		return;
	}
	pll p=*st.begin();
	set<ll>ans;
	ll fi=p.first,se=p.second;
	for(ll i=1;i<=sqrt(fi);i++){
		if(fi%i)continue;
		if(i-se>=1&&i-se<=k)ans.insert(i-se);
		if(i*i!=fi){
			ll num=fi/i-se;
			if(num>=1&&num<=k)ans.insert(num);
		}
		
	}
//	st.erase(st.begin());
	
	ll cnt=0,sum=0;
	for(auto it:ans){
		bool flag=1;
		
		for(auto ite:st){
			if(ite.first%(ite.second+it)){
				flag=0;break;
			}
		}
		
		
		
		
		if(flag)cnt++;sum+=it;
	}
	
	
	
	
	
	
	cout<<cnt<<' '<<sum<<'\n';
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int tt;
	cin>>tt;
	while(tt--){
		solve();
	}
}