#include<bits/stdc++.h>
#define rep(i,l,r) for(int i=l;i<=r;++i)
using namespace std;
using ll =int;
const int N=1e6+50;
const int mod=1e9+7;
//#define int long long
#define pb push_back
int a[N],b[N],n,rs[N],ls[N],sta[N],g[N],vis[N];
int tp=0;
ll getmi(ll a,ll x)
{
    ll rt=1;
    while(x)
    {
        if(x&1) rt=rt*a%mod;
        a=a*a%mod,x>>=1;
    }
    return rt;
}
void dfs(ll x)
{
    if(ls[x]!=-1)dfs(ls[x]),g[x]=__gcd(g[x],g[ls[x]]);
    if(rs[x]!=-1) dfs(rs[x]),g[x]=__gcd(g[x],g[rs[x]]);
}
bool check(ll xx)
{
    rep(i,1,n) g[i]=a[i]+xx;
    ll flg=0;
    rep(x,1,n)
    {
        if(ls[x]!=-1) if(g[ls[x]]%(g[x])!=0) return false;
        if(rs[x]!=-1) if(g[rs[x]]%(g[x])!=0) return false;
    }
    if(flg) return false;
    return true;
}
void solve()
{
    ll k;
    ll cnt=0;
    long long sum=0;
    cin>>n>>k;
    rep(i,1,n) cin>>a[i];
    ll mn=a[1],gg=abs(a[2]-a[1]);
    rep(i,1,n) mn=min(mn,a[i]);
    ll fg=1;
    rep(i,2,n)
    {
        if(a[i]!=a[1])
        {
            fg=0;gg=__gcd(gg,abs(a[i]-a[i-1]));
        } 
        //cout<<gg<<"\n";
    }
    if(fg) return cout<<k<<" "<<(ll)k*(k+1)/2<<"\n",void();
    rep(i,1,n)
    {
        if(a[i]==mn)
        {
            tp=i;
        }
    }
    int top=0,cur=0;
    rep(i,1,n)sta[i]=0,b[i]=a[i],ls[i]=rs[i]=-1;
    for(int i=1;i<=n;i++)
    {
        cur=top;
        while(cur&&b[sta[cur]]>b[i])
            cur--;
        if(cur)
            rs[sta[cur]]=i;
        if(cur<top)
            ls[i]=sta[cur+1];
        sta[++cur]=i;
        top=cur;
    }
    vector<int> ans;
    for(int i=1;i*i<=gg;i++)
    {
        if(gg%i==0) ans.push_back(i);
        if(gg!=i*i) ans.push_back(gg/i);
    }
    for(auto u:ans)
    {
        if(u-mn<=0||u-mn>k) continue;
        if(check(u-mn))
        {
            cnt++;sum+=u-mn;
        }
    }
    cout<<cnt<<" "<<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;
}