#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const ll N = 3e5 + 5;
const ll P = 998244353;
ll n, m, k;

void solve() {
    cin >> n >> k;
    vector<int> b(n + 2);
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
    }
    sort(b.begin() + 1, b.begin() + 1 + n);
    int now = 0;
    for (int i = 2; i <= n; i++) {
        now = __gcd(b[i] - b[1], now);
    }
    if (now == 0) {
        cout << k << ' ' << (k + 1) * (k) / 2 << '\n';
        return;
    }
    // cout << now << ' ';
    ll sum = 0, ans = 0;
    for (ll i = 1; i * i <= now; i++) {
        if (now % i == 0) {
            if (i > b[1] && i - b[1] <= k) {
                // cout << i << ' ';
                sum++;
                ans += i - b[1];
            }
            if ((now / i) > b[1] && (now / i) != i && (now / i) - b[1] <= k) {
                // cout << i << ' ';
                sum++;
                ans += (now / i) - b[1];
            }
        }
    }
    cout << sum << ' ' << ans << '\n';
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}