/**
 *    title:  m.cpp
 *    author:  Proaes Meluam
 *    created:  2024-11-15 21:39:02
**/
#include <bits/stdc++.h>
#ifdef LOCAL
#include "algo/debug.h" 
#else
#define debug(...) 42
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
const double E = exp(1);
constexpr ll mod = 1e9 + 7;
// constexpr int inf = 0x3f3f3f3f;
constexpr ll inf = 0x3f3f3f3f3f3f3f3f;
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto frac = [&](ll x) {
        vector<ll> f;
        // f.emplace_back(1);
        for (ll i = 1; i * i <= x; ++ i) {
            if (x % i == 0) {
                if (i != x / i) {
                    f.emplace_back(i);
                    f.emplace_back(x / i);
                } else {
                    f.emplace_back(i);
                }
            }
        }
        sort(f.begin(), f.end());
        return f;
    };

    int tt = 1;
    cin >> tt;
    while (tt--) {
        ll ans1 = 0, ans2 = 0;
        ll n, k, minb = inf;
        cin >> n >> k;
        vector<ll> b(n + 1);
        for (int i = 1; i <= n; ++ i) {
            cin >> b[i];
            minb = b[i];
        }
        auto check = [&](ll x) -> bool {
            if (x > 0) {
                bool res = 1;
                vector<ll> a(n + 1);
                for (int i = 1; i <= n; ++ i) {
                    a[i] = b[i] + x;
                    if (i > 1) {
                        if (a[i] % a[i - 1] == 0 || a[i - 1] % a[i] == 0) {

                        } else {
                            res = 0;
                            break;
                        }
                    }
                    
                }
                return res;
            } else {
                return 0;
            }
        };
        if (n == 1) {
            ans1 = k;
            ans2 = k * (k + 1ll) / 2ll;
        } else {
            ll g = b[2] - b[1];
            for (int i = 3; i <= n; ++ i) {
                g = gcd(g, b[i] - b[i - 1]);
            }
            vector<ll> fg = frac(g);
            // debug(g);
            // debug(fg);
            for (auto y : fg) {
                ll x = y - minb;
                // debug(x);
                if (check(x)) {
                    ans1 += 1;
                    ans2 += x;
                }
            }
        }
        cout << ans1 << " " << ans2 << "\n";
    }
}