#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> PII;
const int N=5e5+10,M=2*N;
//const int mod=998244353;
const LL mod=1e9+7;
const LL INF=1e18+7;
//LL h[N],e[M],ne[M],idx;
int T=1;
LL lc[N],rc[N],d[N];


LL gcd(LL a,LL b){
    if(!a) return b;
    return b?gcd(b,a%b):a;
}


void dfs(vector<PII>& res,int u,vector<LL>& a){
    //d[u]=a[u-1];
    if(lc[u]) dfs(res,lc[u],a);
    if(rc[u]) dfs(res,rc[u],a);

    if(!lc[u]&&!rc[u]) return;


    if(lc[u]) d[u]=gcd(abs(a[u-1]-a[u-2]),d[lc[u]]);
    if(rc[u]) d[u]=gcd(d[u],gcd(abs(a[u-1]-a[u]),d[rc[u]]));

    res.push_back({d[u],a[u-1]});

}

void solve(){
    LL n,k;
    cin>>n>>k;


    vector<LL> a,c;


    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        a.push_back(x);
    }

    c=a;

    sort(a.begin(),a.end());
    //PII q=dp(a,k);
    //cout<<q.first<<" "<<q.second<<endl;
    a.erase(unique(a.begin(),a.end()),a.end());


    vector<LL> b;
    if(T==422){
        cout<<n<<" "<<k<<" ";
        for(auto t:c) cout<<t<<" ";
        cout<<endl;
    }

    for(int i=1;i<a.size();i++) b.push_back(a[i]-a[i-1]);

    sort(b.begin(),b.end());
    b.erase(unique(b.begin(),b.end()),b.end());

    if(a.size()==1){
        LL res=(LL)(k)*(k+1)/2;
        cout<<k<<" "<<res<<endl;

        return;
    }
    
    LL t=b[0];
    LL res=0,num=0;

    //for(auto g:b) cout<<g<<" ";
    //cout<<endl;

    for(int i=1;i<b.size();i++){
        t=gcd(b[i],t);
    }

    if(t==1){
        cout<<0<<" "<<0<<endl;
        return;
    }
    vector<LL> ans;
    for(LL i=1;i*i<=t;i++){
        if(t%i) continue;

        ans.push_back(i);
        if(i*i!=t) ans.push_back(t/i);
    }
    //ans.push_back(t);
    vector<LL> ft;
    for(auto g:ans){
        //cout<<g<<endl;
        if(a[0]>=g) continue;
        if(g>k+a[0]) continue;
        //cout<<g-a[0]<<endl;
        ft.push_back(g-a[0]);
    }

    vector<LL>tmp;
    

    for(int i=0;i<=n;i++) rc[i]=lc[i]=0;


    int q[n+1],top=-1;


    for(int i=1;i<=n;i++){
        int t=top;


        while(t>=0&&c[i-1]<c[q[t]-1]) --t;

        if(t!=top) lc[i]=q[t+1];
        if(t>=0) rc[q[t]]=i;


        q[++t]=i,top=t;
    }

    int root=q[0];


    vector<PII> req;
    dfs(req,root,c);

    //for(auto t:req) cout<<t.first<<" "<<t.second<<endl;

    for(auto [x,y]:req){
        for(auto t:ft){
            if(x%(t+y)) continue;
            tmp.push_back(t);
        }

        ft=tmp;
        tmp.clear();
    }


    for(auto t:ft) res+=t,num++;
    cout<<num<<" "<<res<<endl;

 }   
 
 
 int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>T;
    
    while(T--) solve();
 
    return 0;
}