#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> 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;


int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}


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


    vector<int> a(n);


    for(int i=0;i<n;i++) cin>>a[i];

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

        return;
    }

    sort(a.begin(),a.end());

    a.erase(unique(a.begin(),a.end()),a.end());

    vector<int> b;


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


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

    vector<LL> ans;
    for(int i=2;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);
    for(auto g:ans){
        //cout<<g<<endl;
        if(a[0]>=g) continue;
        if(g-a[0]>k) continue;
        res+=g-a[0],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;
}