//
// Created by 10842 on 24-11-27.
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int M=3e5+7;
const ll inf=0x3f3f3f3f3f3f;

set<ll>s;

void prime(ll n)
{
    for(ll i=1;i*i<=n;i++)
    {
        if(n%i==0)
        {
            s.insert(i);
            if(n/i!=i)
            {
                s.insert(n/i);
            }
        }
    }
}

void solve()
{
    s.clear();
    ll i,j,k,x=0,sum=0,m=inf,n,p,g=0;
    cin>>n>>k;
    ll a[n];
    for(i=0;i<n;i++)
    {
        cin>>a[i];
        m=min(m,a[i]);
    }
    sort(a,a+n);
    for(i=n-1;i>0;i--)
    {
        g=__gcd(g,a[i]-a[i-1]);
    }
    if(!g)
    {
        cout<<k<<" "<<(k+1)*k/2<<"\n";
        return;
    }
    prime(g);
    for(auto e:s)
    {
        if(e>m&&e<=k)
        {
            x++;
            sum+=e-m;
        }
    }
    cout<<x<<" "<<sum<<"\n";
}

int main()
{
    ios::sync_with_stdio(false);
//    cin.tie(0);
    ll t;
    cin>>t;
    while(t--)
    {
        solve();
    }
}