#include "bits/stdc++.h"
using namespace std;
#define all(x) x.begin(),x.end()
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << p.first << " " << p.second; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#define ASSERT(...) 42
#endif
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int oo = 1e9;
struct node {
    int mn=oo, mnid=-1,g=0;
    node() {
        // *this = node(0);
        
    }
    node(int val, int id) {
        mn=val;
        mnid=id;
        g=val;
    }
    void merge(const node& o) {
        g=__gcd(g,o.g);
        if(mn>o.mn) {
            mn=o.mn;
            mnid=o.mnid;
        }
    }
    friend node merge(node a, const node& b) {
        a.merge(b);
        return a;
    }
};
struct segtree {
    int ptwo;
    vector<node> seg;
    segtree(){}
    node& operator[](int i) {
        return seg[i+ptwo];
    }
    segtree(int nn) {
        ptwo=nn;
        seg.assign(ptwo*2,{});
    }
    auto query(int l, int r) {
        assert(l>=0 and l<ptwo and r >=0 and r<ptwo);
        l+=ptwo; r+=ptwo;
        node resl, resr;
        while(l and l<=r) {
            if(l%2==1) resl = merge(resl,seg[l++]);
            if(r%2==0) resr = merge(seg[r--],resr);
            l/=2; r/=2;
        }
        return merge(resl,resr);
    }

    void build() {
        for(int i=ptwo-1;i>=1;--i) {
            seg[i] = merge(seg[2*i],seg[2*i+1]);
        }
    }
};
void solve() {
    int n,k; cin >> n >> k;
    vi b(n);
    for(auto& i : b) cin >> i;
    int g=0;
    for(int i=0;i<n-1;++i) g=__gcd(g,abs(b[i]-b[i+1]));
    if(g==0) {
        cout << k << ' ';
        cout << ll(k)*(k+1)/2 << '\n';
    } else {
        ll num=0;
        ll ans=0;
        int mid = min_element(all(b))-b.begin();
        auto check = [&](int x) {
            x-=b[mid];
            if(1<=x and x<=k) {
                // need to do range gcd's and range minimums
                segtree seg(n);
                for(int i=0;i<n;++i) seg[i]={b[i]+x,i};
                seg.build();
                bool bad=0;
                auto rec = [&](auto&& self, int l, int r) {
                    if(l==r) return;
                    auto v = seg.query(l,r-1);
                    if(v.g==0) return;
                    if(v.g%v.mn!=0) {
                        bad=1;
                        return;
                    }
                    self(self,l,v.mnid);
                    if(bad) return;
                    self(self,v.mnid+1,r);
                };
                rec(rec,0,n);
                if(!bad) {
                    num++;
                    ans+=x;
                }
            }
        };
        for(int i=1;i*i<=g;++i) {
            if(g%i==0) {
                check(i);
                if(g/i!=i) check(g/i);
            }
        }

        cout << num << ' ' << ans << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t; cin >> t;
    while(t--) solve();
}