#include <bits/stdc++.h>
#define ls(p) (p<<1)
#define rs(p) (p<<1|1)
#define mid (l+r>>1)
using namespace std;
const int N=5e4+10;
int minn[N][20],lg[N],n,k,b[N],a[N],cnt,num[N];
struct TREE
{
	int dat;
}tr[N<<2];
struct node
{
	int l,r,pos;
}x[N];
int gcd(int x,int y)
{
	if(!x||!y) return x|y;
	return __gcd(x,y);
}
void build(int p,int l,int r)
{
	if(l==r) {tr[p].dat=a[l]<0?-a[l]:a[l];return;}
	build(ls(p),l,mid);
	build(rs(p),mid+1,r);
	tr[p].dat=gcd(tr[ls(p)].dat,tr[rs(p)].dat);
}
int query(int p,int l,int r,int ll,int rr)
{
	if(ll<=l&&r<=rr) return tr[p].dat;
	if(ll<=mid&&rr>mid) return gcd(query(ls(p),l,mid,ll,rr),query(rs(p),mid+1,r,ll,rr));
	if(ll<=mid) return query(ls(p),l,mid,ll,rr);
	else return query(rs(p),mid+1,r,ll,rr);
}
int query(int l,int r)
{
	int k=lg[r-l+1];
	int pos1=minn[l][k],pos2=minn[r-(1<<k)+1][k];
	return b[pos1]<b[pos2]?pos1:pos2;
}
void solve(int l,int r)
{
	if(l>=r) return;
	int pos=query(l,r);
	x[++cnt]=(node){l,r,pos};
	solve(l,pos-1);solve(pos+1,r);
}
int main()
{
	for(int i=2;i<N;i++) lg[i]=lg[i>>1]+1;
	int T;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d %d",&n,&k);
		bool flag=true;int maxx=0;
		for(int i=1;i<=n;i++)
			scanf("%d",&b[i]),a[i]=b[i]-b[i-1],flag&=(i==1||a[i]==0),maxx=max(maxx,b[i]);
		if(flag)
		{
			printf("%d %lld\n",k,1ll*k*(k+1)/2);
			continue;
		}
		build(1,1,n);
		for(int i=1;i<=n;i++)
			minn[i][0]=i;
		for(int j=1;(1<<j)<=n;j++)
			for(int i=1;i+(1<<j)-1<=n;i++)
				minn[i][j]=b[minn[i][j-1]]<b[minn[i+(1<<j-1)][j-1]]?minn[i][j-1]:minn[i+(1<<j-1)][j-1];
		cnt=0;
		solve(1,n);
		for(int i=1;i<=cnt;i++)
			num[i]=query(1,1,n,x[i].l+1,x[i].r);
		maxx=sqrt(maxx)*2;
		long long ans=0,ans1=0;
        vector<long long> ori;
        long long GCD = num[1];
        for (int i=1;i*i<=GCD;i++) {
            if (GCD % i == 0) {
                ori.push_back(i);
                if (i*i != GCD) ori.push_back(GCD / i);
            }
        }

        int mn=*min_element(b+1,b+1+n);
		for(int t:ori)
		{
			bool flag=true;
            int i=t-mn;
            if(i<=0 || t > k) continue;
			for(int j=1;j<=cnt;j++)
				if(!(num[j]%(b[x[j].pos]+i)==0&&(b[x[j].l]+i)%(b[x[j].pos]+i)==0))
				{
					flag=false;
					break;
				}
                // cout<<"SS"<<i<<' '<<flag<<endl;
			if(flag) ans++,ans1+=i;
		}
		printf("%lld %lld\n",ans,ans1);
	}
}