#include<stack>
#include<stdio.h>
#include<iostream>
#include<algorithm>
#define inf 0X7fffffff
#define int long long 
using namespace std;
const int N=2e5+9;
int read(int &x){
    int dat=0,oko=1;char chc=getchar();
    while(chc<'0'||chc>'9'){if(chc=='-')oko=-1;chc=getchar();}
    while(chc>='0'&&chc<='9'){dat=dat*10+chc-'0';chc=getchar();}
    x=dat*oko;return x;
}int T,n,k,_gcd,a[N],b[N],c[N],ans1,ans2;
int tree[N<<2],f1[N],f2[N];
stack<int>q,zero;
int gcd(int x,int y){
    while(y){x%=y;swap(x,y);}
    return x;
}bool check(int x){
    for(int i=1;i<=n;i++){
        if(f1[i]&&(c[i]+x)%(f1[i]+x))return false;
    }return true;
}
void prework(){
    while(!q.empty())q.pop();
    for(int i=1;i<=n;i++){
        f1[i]=0;
        while(!q.empty()&&q.top()>c[i])q.pop();
        if(!q.empty())f1[i]=q.top();
        q.push(c[i]);
    }
}
void solve(){
    cin>>n>>k;ans1=0,ans2=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];c[i]=a[i];
    }sort(a+1,a+1+n);_gcd=0;
    prework();
    for(int i=2;i<=n;i++){
        _gcd=gcd(_gcd,a[i]-a[i-1]);
    }if(!_gcd){
        cout<<k<<" "<<(((k+1)*k)>>1)<<"\n";
        return;
    }for(int i=1;i*i<=_gcd;i++){
        if(_gcd%i)continue;
        if(a[1]+k>=i&&i>a[1]){
            if(check(i-a[i])){
                ans1++;ans2+=i-a[1];
            }
        }int j=_gcd/i;if(i==j)continue;
        if(a[1]+k>=j&&j>a[1]){
            if(check(j-a[1])){
                ans1++;ans2+=j-a[1];
            }
        }
    }cout<<ans1<<" "<<ans2<<"\n";
}
signed main(){
    cin>>T;
    while(T--)solve();
    return 0;
}
/*
3
5 10
7 79 1 7 1
2 1000000000
1 2
1 10000
1000000000
*/