#include<bits/stdc++.h>

#define int long long
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;

void solve();


signed main() {
    fast
    int t = 1;
    cin >> t;
    while (t--) solve();
}

const int N = 5e4 + 10;

int n, k;
int a[N], b[N];

vector<int> fac(int x){
    vector<int> res;
    for(int i = 1; i * i <= x; i++){
        if(x % i == 0){
            res.push_back(i);
            if(i * i != x) res.push_back(x / i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

int gcd_seq(int l, int r, int x){
    int d = 0;
    for(int i = l; i <= r; i++){
        d = gcd(d, a[i] + x);
    }
    return d;
}

bool check(int l, int r, int x){
    if(l >= r) return true;
    int d = gcd_seq(l, r, x), mn = *min_element(a + l, a + r + 1) + x;
    if(d != mn) return false;
    int lst = l;
    bool res = true;
    for(int i = l; i <= r; i++){
        if(a[i] + x == d){
            res &= check(lst, i - 1, x);
            lst = i + 1;
        }
    }
    res &= check(lst, r, x);
    return res;
}

void solve() {
    cin >> n >> k;
    for(int i = 1; i <= n; i++) cin >> b[i], a[i] = b[i];

    if(*max_element(a + 1, a + n + 1) == *min_element(a + 1, a + n + 1)){
        cout << k << ' ' << k * (k + 1) / 2 << '\n';
        return;
    }

    sort(a + 1, a + n + 1);
    int d = 0;
    for(int i = 2; i <= n; i++) d = gcd(d, a[i] - a[i - 1]);
    auto facs = fac(d);
    int cnt = 0, sum = 0;
    for(auto f : facs){
        if(f <= a[1]) continue;
        if(a[1] + k < f) break;
        int x = f - a[1];
        if(check(1, n, x)) cnt++, sum += x;
    }
    cout << cnt << ' ' << sum << '\n';
}