#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 5e4 + 10;
int t = 1, n, k;
int l[N], r[N];
int st[N][20], a[N]; // 区间长度最大不超过2^20
int Log[N];
int gcd(int a, int b)
{
    if (!b)
        return a;
    else
        return gcd(b, a % b);
}
int query(int l, int r)
{
    int k = Log[r - l + 1];
    return gcd(st[l][k], st[r - (1 << k) + 1][k]);
}
int ask(int l, int r)
{
    if (l > r)
    {
        return 0;
    }
    int s = __lg(r - l + 1);
    return gcd(st[l][s], st[r - (1 << s) + 1][s]);
}
int check(int x)
{
    vector<int> b(n + 3);
    for (int i = 1; i <= n; i++)
        b[i] = a[i] + x;
    for (int i = 0; i < n; i++)
        st[i][0] = b[i + 1];
    for (int j = 1; j < 20; j++)
    {
        for (int i = 0; i + (1 << j) - 1 < n; i++)
        {
            st[i][j] = gcd(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
        }
    }
    for (int i = 1; i <= n; i++)
    {
        int d = ask(l[i] - 1, r[i] - 1);
        if (d != b[i])
            return 0;
    }
    return 1;
}
void solve()
{

    l[0] = 0;
    r[n + 1] = n + 1;
    deque<int> q;
    q.push_back(0);
    for (int i = 1; i <= n; i++)
    {
        while (!q.empty() && a[q.back()] >= a[i])
            q.pop_back();
        if (!q.empty())
            l[i] = q.back();
        q.push_back(i);
    }
    q.clear();
    q.push_back(n + 1);
    for (int i = n; i >= 1; i--)
    {
        while (!q.empty() && a[q.back()] >= a[i])
            q.pop_back();
        if (!q.empty())
            r[i] = q.back();
        q.push_back(i);
    }
    for (int i = 1; i <= n; i++)
    {
        l[i]++;
        r[i]--;
    }
    int w = 0;
    int lst = 0;
    for (int i = 2; i <= n; i++)
    {
        if (a[i] != a[i - 1])
        {
            w = abs(a[i] - a[i - 1]);
            lst = min(a[i], a[i - 1]);
        }
    }
    if (w == 0)
    {
        cout << k << " " << k * (k + 1ll) / 2ll << "\n";
        return;
    }
    vector<int> ve;
    for (int i = 1; i * i <= w; i++)
    {
        if (w % i == 0)
        {
            ve.push_back(i);
            if (i * i != w)
                ve.push_back(w / i);
        }
    }
    int cnt = 0, sum = 0;
    for (auto x : ve)
    {
        int c = x - lst;
        if (c >= 1 && c <= k)
        {
            if (check(c))
            {
                cnt++;
                sum += c;
            }
        }
    }
    cout << cnt << " " << sum << "\n";
    return;
}
signed main()
{
    // cerr << (1 << 20) << endl;
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    Log[1] = 0;
    for (int i = 2; i < N; i++)
        Log[i] = Log[i / 2] + 1;
    cin >> t;
    while (t--)
    {
        cin >> n >> k;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
        solve();
    }

    return 0;
}