#include<bits/stdc++.h>
using namespace std;

// #define int long long
#define x first
#define y second 
#define ls u << 1
#define rs u << 1 | 1
#define PII pair<int,int>  

const int N = 5e4 + 10, inf = 1e18, mod1 = 998244353, mod2 = 1e9 + 7, M = 18;

int lg[N];

int gcd(int a, int b) {
    return (b == 0 ? a : gcd(b, a % b));
}

int lowbit(int x) {
    return x & -x;
}

PII pos[N];
int tr[N];

void add(int x) {
    for(; x < N; x += lowbit(x)) tr[x] ++;
}

int query(int x) {
    int res = 0;
    for(; x; x -= lowbit(x)) res += tr[x];
    return res;
}

int f[N][M];

int get(int l, int r) {
    int k = lg[r - l + 1];
    return gcd(f[l][k], f[r - (1 << k) + 1][k]);
}

struct node {
    int l, r, d;
}tr1[N * 4];

void pushup(int u) {
    tr1[u].d = gcd(tr1[ls].d, tr1[rs].d);
}

void build(int u, int l, int r) {
    tr1[u] = {l, r, 0};
    if(l == r) return;
    int mid = l + r >> 1;
    build(ls, l, mid); build(rs, mid + 1, r);
}

void modify(int u, int l, int r, int d) {
    if(tr1[u].l >= l && tr1[u].r <= r) tr1[u].d = d;
    else {
        int mid = tr1[u].l + tr1[u].r >> 1;
        if(l <= mid) modify(ls, l, r, d);
        if(r > mid) modify(rs, l, r, d);
        pushup(u);
    }
}

int query1(int u, int l, int r) {
    if(tr1[u].l >= l && tr1[u].r <= r) return tr1[u].d;
    int mid = tr1[u].l + tr1[u].r >> 1;
    if(l <= mid && r > mid) return gcd(query1(ls, l, r), query1(rs, l, r));
    else if(l <= mid) return query1(ls, l, r);
    else return query1(rs, l, r);
}

void solve() {
    int n;
    long long k; cin >> n >> k; 
    vector<int>a(n + 1); int mi = inf;
    vector<PII>vec;
    for(int i = 1; i <= n; i ++) cin >> a[i], mi = min(mi, a[i]), vec.push_back({a[i], i}), tr[i] = 0;
    sort(vec.begin(), vec.end());
    for(int i = 0; i < n; i ++) {
        vector<int>vv; vv.push_back(vec[i].y);
        while(i < n - 1 && vec[i + 1].x == vec[i].x) vv.push_back(vec[i + 1].y), i ++;
        for(int j = 0; j < vv.size(); j ++) add(vv[j]);
        for(int j = 0; j < vv.size(); j ++) {
            int l = 0, r = vv[j] - 1;
            int ss = query(vv[j]) - 1;
            while(l <= r) {
                int mid = l + r >> 1;
                if(query(mid) == ss) r = mid - 1;
                else l = mid + 1;
            }
            pos[vv[j]].x = l + 1;
            l = vv[j] + 1, r = n;
            while(l <= r) {
                int mid = l + r >> 1;
                if(query(mid) == ss) l = mid + 1;
                else r = mid - 1;
            }
            pos[vv[j]].y = r;
        }
    }
    int d = 0;
    for(int i = 1; i < n; i ++) d = gcd(d, abs(a[i] - a[i + 1]));
    if(d == 0) {
        cout << k << ' ' << k * (k + 1) / 2 << '\n';
        return;
    }
    vector<int>v;
    for(int i = 1; i * i <= d; i ++)
        if(d % i == 0) {
            v.push_back(i);
            if(i != d / i) v.push_back(d / i);
        }
    int cnt = 0;
    long long res = 0;
    for(auto x : v) {
        if(x <= mi || x - mi > k) continue;
        int y = x - mi;
        bool ok = true;
        build(1, 1, n);
        for(int i = 1; i <= n; i ++) modify(1, i, i, a[i] + y);
        for(int i = vec.size() - 1; i >= 0; i --) {
            if(query1(1, pos[vec[i].y].x, pos[vec[i].y].y) != a[vec[i].y] + y) {
                ok = false;
                break;
            }
        }
        if(ok) cnt ++, res += y;
    }
    cout << cnt << ' ' << res << '\n';
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int t = 1; cin >> t;
    for(int i = 2; i < N; i ++) lg[i] = lg[i / 2] + 1;
    while(t --)
        solve();
    return 0;
}