#include <bits/stdc++.h>
using namespace std;
#define vv vector
#define ll long long
const int N = 200000 + 5;
const int P = 1e9 + 7;
const ll inf = 1e18;

mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<ll> rd(0, 1e9);
inline ll rnd() { return rd(gen); }

void qfl_zzz()
{
    ll n, k;
    cin >> n >> k;
    vv<ll> a(n + 1);
    for (ll i = 1; i <= n; ++i)
        cin >> a[i];
    sort(a.begin() + 1, a.end());

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

    ll g = 0;
    for (ll i = 2; i <= n; ++i)
        g = __gcd(g, a[i] - a[i - 1]);

    set<ll> s;
    auto upd = [&](ll d)
    {
        ll x = d - a[1];
        if (1 <= x && x <= k)
            s.insert(x);
    };
    for (ll i = 1; i * i <= g; ++i)
        if (g % i == 0)
        {
            upd(i);
            if (i * i != g)
                upd(g / i);
        }

    ll cnt = 0, sum = 0;
    for (ll x : s)
        ++cnt, sum += x;
    cout << cnt << " " << sum << "\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    srand(unsigned(time(0)));
    cout << setiosflags(ios::fixed) << setprecision(12);

#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("std.txt", "w", stdout);
#endif

    int T = 1;
    cin >> T;
    while (T--)
        qfl_zzz();

    return 0;
}