#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e5 + 10;

int n, k;
int b[maxn];
int a[maxn];
void solve()
{
    cin >> n >> k;
    map<int, int> mp;
    for (int i = 1; i <= n; i++)
    {
        cin >> b[i];
        mp[b[i]]++;
    }
    int fxs = 1;
    for (auto [x, y] : mp)
    {
        a[fxs++] = x;
    }
    n = fxs - 1;
    set<int> st;
    int sum = 0;
    if (n == 1)
    {
        cout << k << ' ';
        cout << (1ll + k) * k / 2ll << '\n';
        return;
    }
    for (int i = 1; i < n; i++)
    {
        int r = a[i + 1];
        int l = a[i];
        int kx = r / l;
        if (i == 1)
        {
            if (l == 1)
            {
                int y = r - l;
                for (int j = 1; j * j <= y; j++)
                {
                    if (y % j == 0)
                    {
                        if (j == 1)
                        {
                        }
                        else
                        {
                            if ((j - 1) <= k && (r + j - 1) % (l + j - 1) == 0)
                            {
                                st.insert(j - 1);
                                sum += j - 1;
                            }
                        }
                    }
                    if (y % j == 0 && j * j != y)
                    {
                        int le = y / j;
                        if (le == 1)
                        {
                        }
                        else
                        {
                            if ((le - 1) <= k && (r + le - 1) % (l + le - 1) == 0)
                            {
                                st.insert(le - 1);
                                sum += le - 1;
                            }
                        }
                    }
                }
            }
            else
            {
                for (int j = kx; j >= 2; j--)
                {
                    int les = r - l * j;
                    if (les % (j - 1) != 0)
                        continue;
                    int y = les / (j - 1);
                    if (les == 0)
                        continue;
                    if (y <= k)
                    {
                        st.insert(y);
                        sum += (y);
                    }
                    else
                    {
                        break;
                    }
                }
            }
        }
        else
        {
            set<int> stt;
            sum = 0;
            for (int j = kx; j >= 2; j--)
            {
                int les = r - l * j;
                if (les % (j - 1) != 0)
                    continue;
                int y = les / (j - 1);
                if (les == 0)
                    continue;
                if (y <= k && st.count(y))
                {
                    stt.insert(y);
                    sum += (y);
                }
                else
                {
                    break;
                }
            }
            swap(stt, st);
        }
    }
    if (st.count(0))
        st.erase(0);
    while (st.upper_bound(k) != st.end())
    {
        sum -= *st.rbegin();
        st.erase(--st.end());
    }
    cout
        << st.size() << ' ';

    cout << sum << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}