#include<bits/stdc++.h>
#define ll long long
using namespace std;
int B[50001];
int GCD(int X,int Y)
{
    if(!X||!Y)
    return X^Y;
    return GCD(Y,X%Y);
}
void Solve()
{
    ll N,K;
    scanf("%lld%lld",&N,&K);
    for(int i=1;i<=N;++i)
    {
        scanf("%d",&B[i]);
    }
    sort(B+1,B+N+1);
    if(B[1]==B[N])
    {
        printf("%lld %lld\n",K,(K+1)*K>>1);
        return;
    }
    int Gcd=0;
    for(int i=2;i<=N;++i)
    {
        Gcd=GCD(Gcd,B[i]-B[1]);
    }
    ll Ansa=0,Ansb=0;
    for(int i=1;i*i<=Gcd;++i)
    {
        if(Gcd%i)continue;
        if(i>B[1]&&i<=K)
        {
            ++Ansa;
            Ansb+=i-B[1];
        }
        if(i*i!=Gcd&&Gcd/i>B[1]&&Gcd/i<=K)
        {
            ++Ansa;
            Ansb+=Gcd/i-B[1];
        }
    }
    printf("%lld %lld\n",Ansa,Ansb);
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        Solve();
    }
}