#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef vector<string> VS;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
vector<int> vx;
inline void divide() {sort(vx.begin(),vx.end());vx.erase(unique(vx.begin(),vx.end()),vx.end());}
inline int mp(int x) {return upper_bound(vx.begin(),vx.end(),x)-vx.begin();}
inline int log_2(int x) {return 31-__builtin_clz(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int lowbit(int x) {return x&-x;}
inline ll Lsqrt(ll x) { ll L = 1,R = 2e9;while(L + 1 < R){ll M = (L+R)/2;if(M*M <= x) L = M;else R = M;}return L;}
const int N = 50005;
ll n,k;
void solve()
{
    cin>>n>>k;
    vector<int> a(n);
    vector<ll> arr(n);
    bool is=false;
    for(int i=0;i<n;i++) 
    {
        cin>>arr[i]; 
        a[i] = arr[i];
        if(i>=1&&arr[i]!=arr[i-1]) is=true;
    }
    if(!is)
    {
        cout<<k<<' '<<(k+1)*k/2<<'\n';
        return ;
    }
    sort(arr.begin(),arr.end());
    ll G=0;
    for(int i=1;i<n;i++)
    {
        G=gcd(G,arr[i]-arr[i-1]);
    }
    //cout<<G<<' ';
    ll sum=0,cnt=0;
    vector<int> ans;
    for(int i=1;i*i<=G;i++)
    {
        if(G%i) continue;
        if(i>arr[0]&&k>=i)
        {
        ans.push_back(i - arr[0]);
        }
        if(G/i!=i&&G/i>arr[0]&&k>=G/i)
        {
            ans.push_back(G/i - arr[0]);
        }
    }
    for(auto u:ans)
    {
        bool ok = true;
        for(int i=0;i<n-1;++i)
        {
            if((a[i]+u)%(a[i+1]+u)&&(a[i+1]+u)%(a[i]+u)) {ok = false;break;}
        }
        if(ok) sum += u, cnt ++;
    }
    cout<<cnt<<' '<<sum<<'\n'; 
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	//cin>>T;
    // for(int i=1;i<N;++i)
    // {
    //     for(int j=i;j<N;j+=i)
    //     {
    //         ++cnt[j];//约数个数
    //         sum[j]+=i;//约数个数和
    //     }
    // }
    cin>>T;
	while(T--)
	{
		solve();
	}
}