#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const int N = 1000 + 10;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;

int a[maxn];
ll n, m;
ll cnt, ans;

void check(int x)
{
    for (int i = 2; i <= n; i++)
    {
        int t1 = a[i] + x, t2 = a[i - 1] + x;
        if (t1 < t2)
            swap(t1, t2);
        if (t1 % t2 != 0)
            return;
    }
    ans += x;
    cnt++;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--)
    {
        cin >> n >> m;
        int mx = inf;
        for (int i = 1; i <= n; i++)
            cin >> a[i], mx = min(mx, a[i]);
        sort(a + 1, a + 1 + n);
        n = unique(a + 1, a + 1 + n) - a - 1;
        // cout << n << ' ';

        if (n == 1)
        {
            cout << m << ' ' << m * (m + 1) / 2 << endl;
            continue;
        }
        int g = 0;
        for (int i = 2; i <= n; i++)
            g = __gcd(a[i] - a[i - 1], g);
        cnt = ans = 0;
        for (int i = 1; i * i <= g; i++)
        {
            if (g % i == 0)
            {
                // cout << i << " " << g / i << endl;
                if (i - mx <= m && i - mx >= 1)
                    check(i - mx);
                if (i != g / i && g / i - mx <= m && g / i - mx >= 1)
                    check(g / i - mx);
            }
        }
        cout << cnt << ' ' << ans << endl;
    }
}