#include <iostream>
#include <vector>
#include <set>
#include <climits>
#include <algorithm>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b)
{
    return b == 0 ? a : gcd(b, a % b);
}
struct Node
{
    int val;
    Node* left;
    Node* right;
    Node(int v) : val(v), left(nullptr), right(nullptr) {}
};

Node* buildCartesianTree(vector<int>& arr)
{
    vector<Node*> st;
    for (int v : arr)
    {
        Node* curr = new Node(v);
        Node* last = nullptr;
        while (!st.empty() && st.back()->val > v)
        {
            last = st.back();
            st.pop_back();
        }
        curr->left = last;
        if (!st.empty())
        {
            st.back()->right = curr;
        }
        st.push_back(curr);
    }
    return st.empty() ? nullptr : st.front();
}
set<int> ans;
void dfs(Node* cur, int fa)
{
    vector<int> vec;
    if (fa != -1) {
        for (auto x : ans) {
            if ((cur->val + x) % (fa + x) != 0) {
                vec.push_back(x);
            }
        }
        for (auto x : vec) {
			ans.erase(x);
		}
    }
    if (cur->left != nullptr) {
        dfs(cur->left, cur->val);
    }
    if (cur->right != nullptr) {
        dfs(cur->right, cur->val);
    }
}
int T = 0;
void EachT()
{
    T++;
    ans.clear();
    ll n,k;
    cin >> n>>k;
    vector<int> a(n);
    ll all_gcd = 0;
    ll mina = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        if (i != 0)
        {
            all_gcd = gcd(all_gcd, (ll)abs(a[i] - a[i - 1]));
        }
        mina = min(mina, (ll)a[i]);
    }
    sort(a.begin(), a.end());
    if (T == 178) {
        cout<<n<<"a"<<k<< "a" << a[0]<<"a"<<a[1]<<"a"<<a[2]<<"a"<<a[3];
    }
    if (a[0] == a[n-1]) {
        cout<<k<<" "<<k*(k+1)/2<<endl;
        return;
    }
    for (int i = 1; i * i <= all_gcd; i++)
    {
        if (all_gcd % i == 0)
        {
            if (i - mina > 0 && i-mina<=k)
                ans.insert(i - mina);
            if (all_gcd / i - mina > 0 && (all_gcd / i - mina) <= k)
                ans.insert(all_gcd / i - mina);
        }
    }
    Node begin = *buildCartesianTree(a);
    dfs(&begin, -1);
    ll total = 0;
    for (auto x : ans)
    {
        total += x;
    }
    cout << ans.size() << " " << total << endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--)
        EachT();
    return 0;
}