#include<bits/stdc++.h>

using namespace std;

#define ll long long

void solve(){
    ll n , k ;cin>>n>>k;
    vector<ll> a(n);
    for(ll&x:a) cin>>x;
    ll mx = *max_element(a.begin(),a.end());
    ll mi = *min_element(a.begin(),a.end());
    if(mx == mi){
        cout<<k<<" ";
        cout<<(1 + k) * k /2<<endl;
        return;
    }
    vector<ll> ck;
    ll yd = 0;
    for(ll i =0;i<n - 1;i++){
        if(a[i] == a[i+1]) continue;
        mx = max(a[i] ,a[i+1]);
        mi = min(a[i] ,a[i+1]);
        yd = mi;
        ll d = mx - mi;
        for(ll i = 1;i*i<=d;i++){
            if(d % i == 0){
                ck.push_back(i);
                if(i*i!=d) ck.push_back(d/i);
            }
        }
        break;
    }
    vector<ll> ans;
    ll ans1= 0 ,ans2 = 0;
    mi = *min_element(a.begin(),a.end());
    for(ll x : ck){
        ll g = 0;
        x -= yd;
        if(x <= 0) continue;
        // cout<<x<<" ";
        for(ll y : a) g = __gcd(1ll * g , 0ll + y + x );
        if(g == mi + x && x<=k && 1<=x){
            ans1 ++; ans2 += x;
        }
    }
    cout<<ans1<<" "<<ans2<<endl;
}

signed main(){
    cin.tie(0);cout.tie(0);
    ios::sync_with_stdio(0);
    ll t;cin>>t;while(t--)
        solve();
}