#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
#define int    long long 
typedef pair<int, int>pii;
typedef pair<char, int>pci;
typedef pair<int, pii>piii;
const int mod = 998244353;
const int N = 5e5 + 100;

int n, k;
int a[N];

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

void solve()
{
    cin >> n >> k;
    map<int, int> mp;
    for (int i = 1; i <= n; i++) {
        int t;
        cin >> t;
        mp[t] = t;
    }

    n = mp.size();
    int temp = 1;
    for (auto t : mp) {
        a[temp++] = t.first;
    }

    if (n == 1) {
        cout << k << ' ' << ((k + 1) * k) / 2 << endl;
        return;
    }

    temp = a[2] - a[1];
    for (int i = 2; i <= n; i++) temp = gcd(temp, a[i] - a[i - 1]);

    vector<int> v;
    for (int i = 1; i * i <= temp; i++) {
        if (temp % i == 0) {
            v.push_back(i);
            if(i!=temp/i) v.push_back(temp / i);
        }
    }

    int ans = 0, ans_sum = 0;

    for (auto t : v) {
        //cout << t<<' ';
        if (t - a[1] > k) continue;
        if (t <= a[1]) continue;
        int yu = a[1] % t;
        ans++;
        ans_sum += t - a[1];
        //cout << t << endl;
    }

    cout << ans << ' ' << ans_sum << endl;

}

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