#include <bits/stdc++.h>
#define endl '\n'
// #define int long long

using namespace std;

const int INF = 1e9 + 7;

struct Node {
    int l, r, lstP, nowP;
};
void solve() {
    int n, k, mn = INF, mx = -1;
    cin >> n >> k;
    vector<int> b(n + 1);
    priority_queue<pair<int, int>> pq;
    for(int i = 1; i <= n; i++) {
        cin >> b[i];
        pq.push({-b[i], -i});
        mn = min(mn, b[i]);
        mx = max(mx, b[i]);
    }
    long long ans0 = 0, ans1 = 0;
    if(mn == mx) {
        ans0 = k;
        ans1 = 1ll * (1 + k) * k / 2;
        cout << ans0 << ' ' << ans1 << endl;
        return;
    }
    vector<Node> v;
    v.push_back({1, n, 0, 0});
    int hd = 0;
    while(hd < v.size()) {
        // cout << "hd = " << hd << " L = " << v[hd].l << "  R = " << v[hd].r << " nowP = " << v[hd].nowP << endl;
        int mn = INF;
        vector<int> nxt;//{pos}
        if(v[hd].l == v[hd].r) {
            v[hd].nowP = v[hd].l;
            hd++;
            continue;
        }
        nxt.push_back(v[hd].l - 1);
        while(1) {
            if(pq.empty()) break;
            int vl = -pq.top().first;
            int p = -pq.top().second;
            if(vl > mn || p > v[hd].r)
                break;
            // cout << "get vl = " << vl << "  p = " << p << endl;
            pq.pop();
            nxt.push_back(p);
            mn = vl;
            v[hd].nowP = p;
        }
        nxt.push_back(v[hd].r + 1);
        for(int i = 1; i < nxt.size(); i++) {
            int L = nxt[i - 1] + 1, R = nxt[i] - 1;
            if(L > R) continue;
            v.push_back({L, R, v[hd].nowP, 0});
        }
        hd++;
    }

    auto cal = [&](int x) {
        x -= mn;
        if(x < 1 || x > k)
            return;
        for(int i = 1; i < v.size(); i++) {
            if(v[i].lstP == 0) continue;
            if((b[v[i].nowP] + x) % (b[v[i].lstP] + x) != 0)
                return;
        }
        ans0++;
        ans1 += x;
    };
    int T = mx - mn, sT = sqrt(T);
    for(int i = 1; i <= sT; i++)
        if(T % i == 0) {
            cal(i);
            if(i * i != T)
                cal(T / i);
        }
    cout << ans0 << ' ' << ans1 << endl;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int T = 1;
    cin >> T;
    while(T--) {
        solve();
    }

    return 0;
}