#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

struct UF{
    int n;
    vector<int> par,size,edge;
    
    void init(int n_){
        n=n_;
        par.assign(n,-1);
        size.assign(n,1);
        edge.assign(n,0);
        
        for(int i=0;i<n;i++){
            par[i]=i;
        }
    }
    
    int root(int a){
        if(par[a]==a) return a;
        else return par[a]=root(par[a]);
    }
    
    void unite(int a,int b){
        edge[root(a)]++;
        if(root(a)!=root(b)){
            size[root(a)]+=size[root(b)];
            edge[root(a)]+=edge[root(b)];
            par[root(b)]=root(a);
        }
    }
    
    bool check(int a,int b){
        return root(a)==root(b);
    }
};

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        ll N,K;cin>>N>>K;
        vl A(N);
        for(int i=0;i<N;i++){
            cin>>A[i];
        }
        bool deta=false;
        vl cand;
        for(int i=0;i+1<N;i++){
            if(A[i]!=A[i+1]){
                ll diff=abs(A[i+1]-A[i]);
                ll a=min(A[i],A[i+1]);
                for(ll x=1;x*x<=diff;x++){
                    if(diff%x==0){
                        if(a<x) cand.pb(x-a);
                        if(x*x!=diff&&a<diff/x) cand.pb(diff/x-a);
                    }
                }
                deta=true;
                break;
            }
        }
        if(!deta){
            cout<<K<<" "<<K*(K+1)/2<<"\n";
            continue;
        }
        
        ll aa=0,bb=0;
        
        for(ll s:cand){
            if(s>K) continue;
            
            bool ok=true;
            for(int i=0;i+1<N;i++){
                ll a=A[i]+s,b=A[i+1]+s;
                if(a>b) swap(a,b);
                if(b%a){
                    ok=false;
                    break;
                }
            }
            if(ok){
                aa++;
                bb+=s;
            }
        }
        
        cout<<aa<<" "<<bb<<"\n";
    }
    
}