#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <map>
#include <set>
using namespace std;
using ll=long long;
const int maxn=2e5+5;
const ll mod=998244353;
ll a[maxn], b[maxn], cnt[maxn];
void solve() {
    ll n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        b[i] = a[i];
    }
    sort(b + 1, b + 1 + n);
    if (b[1] == b[n]) {
        cout <<k << " " << (k + 1) * k / 2 << '\n';
        return;
    }
    int x, y;
    for (int i = 2; i <= n; i++) {
        if (b[i - 1] != b[i]) {
            x = b[i - 1];
            y = b[i];
            break;
        }
    }
    int m = y - x;
    set<int> st;
    for (ll i = 1; i * i <= m; i++) {
        if (m % i == 0) {
            int res = m / i - x;
            if (res <= k && res >= 1) st.insert(res);
            if (m / i != i) {
                res = i - x;
                if (res <= k && res >= 1) st.insert(res);
            }
        }
    }
    for(int i=1;i<n;i++) {
        for(auto it=st.begin();it!=st.end();) {
            auto it2=it;
            it2++;
            int x=a[i],y=a[i+1];
            if(x>y) swap(x, y);
            if((y+*it)%(x+*it))
                st.erase(it);
            it=it2;
        }
    }
    cout<<st.size()<<" ";
    ll sum=0;
    for(auto now:st)
        sum+=now;
    cout<<sum<<"\n";
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}