#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define pb(a) push_back(a)
#define all(a) a.begin(), a.end()
vector<ll> divisor(ll n) {
    vector<ll> v;
    for(ll i = 1; i * i <= n; i ++) {
        if(n % i == 0) {
            if(i * i != n) v.pb(n/i);
            v.pb(i);
        }
    }
    return v;
}

void solve() {
    ll n, k;
    cin >> n >> k;
    vector<ll> a(n);
    rep(i, n) {
        cin >> a[i];
    }
    auto b = a;
    sort(all(b));
    ll g = 0;
    rep(i, n - 1) g = __gcd(g, b[i + 1] - b[i]);
    if(g == 0) {
        cout << k << " " << (k + 1) * k / 2 << endl;
        return ;
    }
    ll Min = b[0];
    auto vec = divisor(g);
    ll cnt = 0, ans = 0;
    for(ll e : vec) {
        if(e > Min) {
            if(e - Min > k) continue;
            ans += e - Min;
            cnt ++;
        }
    }
    cout << cnt << " " << ans << endl;
    
}
int main(){
    int t; cin >> t;
    rep(i, t) solve();
    return 0;
}