#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define rep(i, a, b) for(int i = a; i <= b; i ++ )
#define pre(i, a, b) for(int i = a; i >= b; i -- )
using namespace std;
const int N = 1e6 + 10;
int n, m, k;
int a[N];
void solve()
{
    cin >> n >> m;
    rep(i, 1, n) cin >> a[i];
    if(n == 1)
    {
        cout << m << " " << m * (1 + m) / 2 << endl;
        return;
    }
    int w = 0, ma = 1e18, mi = 0;
    rep(i, 1, n) ma = min(ma, a[i]), mi = max(mi, a[i]);
    rep(i, 1, n - 1)
    {
        int x = a[i], y = a[i + 1];
        if(x == y) continue;
        if(x > y) swap(x, y);
        if(!w) w = y - x;
        else w = __gcd(w, y - x);
    }
    if(ma == mi)
    {
        cout << m << " " << m * (1 + m) / 2 << endl;
        return;
    }
    int sum = 0, ans = 0;
    rep(i, 1, sqrt(w))
    {
        if(w % i != 0) continue;
        if(i > ma && i - ma <= m) sum ++ , ans += i - ma;
        if((w / i) != i)
        {
            if(w / i > ma && w / i - ma <= m) sum ++ , ans += (w / i - ma);
        }
    }
    if(sum==1&&ans==1)
    {
        cout<<n<<m;
        rep(i, 1, n)cout<<a[i]<<" ";
    }
    cout << sum << " " << ans << endl;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int _;
    _ = 1;
    cin >> _;
    while(_ -- )
    {
        solve();
    }
    return 0;
}