#include <bits/stdc++.h>
#define int long long
using namespace std;

using LL = long long;


struct dsu {
    int n;
    vector<int> fa;
    vector<int> mn;

    dsu(int _n, vector<int>& v) {
        n = _n;
        fa.assign(n + 1, 0);
        iota(fa.begin(), fa.end(), 0);
        mn=v;
    }

    int find(int x) {
        if (x == fa[x]) {
            return x;
        }
        return fa[x] = find(fa[x]);
    }

    void un(int x, int y) {
        x = find(x), y = find(y);
        fa[x] = y;
        mn[y] = mn[x];
    }
};
vector<int> pos;
vector<int> a;

bool check(int val) {
    // cerr<<val<<endl;
    vector<int> b(a);
    for(auto &v:b)v += val;
    dsu d(b.size(), b);
    for(auto p : pos) {
        if(p>0 && d.mn[d.find(p-1)]>=b[p]) {
            if(d.mn[d.find(p-1)] % b[p] == 0) {
                d.un(p,p-1);
            }
            else return false;
        }
        if(p+1<b.size() && d.mn[d.find(p+1)]>=b[p]) {
            if(d.mn[d.find(p+1)]%b[p] == 0) {
                d.un(p,p+1);
            }
            else return false;
        }
    }
    return true;
}

void solve() {
    int n,k;
    cin>>n>>k;
    a.resize(n);
    for(int i=0;i<n;i++) {
        cin>>a[i];
    }
    pos.resize(n);
    for(int i=0;i<n;i++)pos[i] = i;
    sort(pos.begin(),pos.end(),[&](int i1,int i2) {
        return a[i1] < a[i2];
    });
    int g = 0;
    for(int i=1;i<n;i++) {
        g = __gcd(g, a[pos[i]] - a[pos[0]]);
    }
    // cerr<<g<<endl;
    if(g == 0) {
        cout<<k<<' '<<k*(k+1)/2<<endl;
        return ;
    }
    // cerr<<g<<endl;
    int cnt = 0;
    int sum = 0;
    // set<int> s;
    for(int i=1;i*i<=g;i++) {
        if(g%i == 0) {
            if(i > a[pos[0]] && i-a[pos[0]] <= k) {
                // cerr<<' '<<i<<endl;
                if(check(i-a[pos[0]])) {
                    cnt++;
                    sum += i-a[pos[0]];
                }
                // s.insert(i);
            }
            if(g/i!=i&&g/i>a[pos[0]] && g/i-a[pos[0]]<=k) {
                if(check(g/i-a[pos[0]])) {
                    cnt++;
                    sum += g/i-a[pos[0]];
                }
            }
        }
    }
    cout<<cnt<<' '<<sum<<endl;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}