//  _____   _   _____    _____   _____   _      __    __
// |  ___| | | |  _  \  | ____| |  ___| | |     \ \  / /
// | |__   | | | |_| |  | |__   | |__   | |      \ \/ /
// |  __|  | | |  _  /  |  __|  |  __|  | |       \  /
// | |     | | | | \ \  | |___  | |     | |___    / /
// |_|     |_| |_|  \_\ |_____| |_|     |_____|  /_/
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define lowbit(i) ((i) & -(i))
#define ull unsigned long long
// #define int long long
#define i64 long long
#define endl '\n'
using namespace std;
const int mod = 998244353;
const int N = 2e5 + 10;

void solve()
{
    int n, k;
    cin >> n >> k;
    vector<int> lg(n + 1), a(n + 1), b(n + 1);
    vector<pair<int, int>> c(n + 1);
    vector<array<int, 3>> d;
    lg[1] = 0;
    for (int i = 2; i <= n; i++)
        lg[i] = lg[i >> 1] + 1;
    vector<vector<int>> f(n + 1, vector<int>(lg[n] + 1));
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        c[i] = {a[i], i};
        f[i][0] = abs(a[i] - a[i - 1]);
    }
    for (int j = 1; j <= lg[n]; j++)
        for (int i = 1; i <= n - (1 << j) + 1; i++)
            f[i][j] = __gcd(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
    auto ask = [&](int x, int y)
    {
        if (x > y)
            return 0;
        int l = lg[y - x + 1];
        return __gcd(f[x][l], f[y - (1 << l) + 1][l]);
    };
    sort(c.begin() + 1, c.end());
    set<int> st;
    st.insert(0), st.insert(n + 1);
    for (int i = 1; i <= n; i++)
    {
        auto it = st.lower_bound(c[i].second);
        int r = *it;
        int l = *--it;
        d.push_back({l + 1, ask(l + 2, r - 1), c[i].first});
        st.insert(c[i].second);
    }
    int res = -1, re;
    for (int i = 2; i <= n; i++)
    {
        if (a[i] != a[i - 1])
        {
            res = abs(a[i] - a[i - 1]);
            re = min(a[i], a[i - 1]);
            break;
        }
    }
    if (res == -1)
    {
        cout << k << ' ' << (i64)k * (k + 1) / 2 << endl;
        return;
    }
    i64 ans = 0;
    int cnt = 0;
    auto check = [&](int x)
    {
        for (auto [l, g, y] : d)
        {
            if (__gcd(g, a[l] + x) % (y + x))
            {
                return;
            }
        }
        ans += x, cnt++;
        return;
    };
    for (int i = 1; i * i <= res; i++)
    {
        if (res % i)
            continue;
        if (i - re >= 1)
        {
            check(i - re);
        }
        if (res / i != i)
        {
            if (res / i - re <= k)
            {
                check(res / i - re);
            }
        }
    }
    cout << cnt << ' ' << ans << endl;
    return;
}
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int tt = 1;
    cin >> tt;
    while (tt--)
    {
        solve();
    }
    return 0;
}