#include <bits/stdc++.h>
using namespace std;
#define int long long
int __ = 1,n;
const int N = 1e5 + 5;

int b[N];
int mn,k;
bool check(int x)
{
    return x > mn && x - mn <= k;
}
void solve(){
    int n;
    cin >> n >> k;
    mn = 1e9;
    for(int i = 1; i <= n; i++) cin >> b[i], mn = min(mn,b[i]);
    if(n == 1)
    {
        cout << k << ' ' << (1 + k) * k / 2 << endl;
        return;
    }
    int g = 0;
    for(int i = 1; i <= n; i++) g = gcd(g,b[i] - mn);
    if(g == 0)
    {
        cout << k << ' ' << (1 + k) * k / 2 << endl;
        return;
    }
    int cnt = 0, sum = 0;
    for(int i = 1; i <= g / i; i++)
        if(g % i == 0)
        {
            if(check(i)) cnt ++, sum += i - mn;
            if(i * i != g && check(g/i)) cnt ++, sum += g / i - mn;
        }
    cout << cnt << ' ' << sum << endl;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    cin >> __;
    while (__--){
        solve();
    }
    return 0;
}