#include <bits/stdc++.h>
#define int long long
#define endl '\n'
int INF = 0x3f3f3f3f3f3f3f3f;
using namespace std;
typedef pair<int, int> PII;
void init()
{
}
void solve()
{
    int n, l;
    cin >> n >> l;
    vector<int> d(n + 1);
    vector<int> a(n + 1);
    int ggcd = 0;
    int minn = INF;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        minn = min(minn, a[i]);
        d[i] = abs(a[i] - a[i - 1]);
        if (i != 1)
        {
            ggcd = __gcd(ggcd, d[i]);
        }
    }
    set<int> st;
    if (ggcd == 0)
    {
        cout << l << " ";
        cout << (1 + l) * l / 2 << endl;
        return;
    }
    int sum = 0;
    for (int i = 1; i * i <= ggcd; i++)
    {
        if (ggcd % i == 0)
        {
            int u = i;
            int k = u - minn;
            if (k > 0 && k <= l)
            {
                if (__gcd(a[1] + k, ggcd) == u)
                {
                    st.insert(k);
                    sum += k;
                }
            }
            int v = ggcd / i;
            k = v - minn;
            if (k > 0 && k <= l)
            {
                if (__gcd(a[1] + k, ggcd) == v)
                {
                    st.insert(k);
                    sum += k;
                }
            }
        }
    }
    for (int i = 1; i <= n - 1; i++)
    {
        set<int> st1 = st;
        for (auto u : st)
        {
            if (__gcd(a[i] + u, a[i + 1] + u) != min(a[i], a[i + 1]) + u)
            {
                st1.erase(u);
                sum -= u;
            }
        }
        st = st1;
    }
    cout << st.size() << " " << sum << endl;
}
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    int t;
    t = 1;
    cin >> t;
    init();
    while (t--)
    {
        solve();
    }
}