#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    set<int> s;
    for (auto &i : a) {
        std::cin >> i;
        s.insert(i);
    }
 
    if (s.size() == 1) {
        std::cout << k << " " << k * (k + 1) / 2 << "\n";
        return ;
    }
 
    int x, y;
    for (int i = 0; i < n - 1; i ++) if (a[i] != a[i + 1]) {
        x = a[i];
        y = a[i + 1];
        break;
    }
    if (x > y) std::swap(x, y);
    int d = y - x;
     
    auto check = [&](int add) {
        if (add > k || add <= 0) return false;
 
        auto b = a;
        for (auto &i : b) i += add;
 
        for (int i = 1; i < n; i ++) if (std::max(b[i], b[i - 1]) % std::min(b[i], b[i - 1])) return false;
        return true;
    };
 
    int cnt = 0, sum = 0;
    for (int i = 1; i * i <= d; i ++) if (d % i == 0) {
        if (check(i - x)) cnt ++, sum += i - x;
        if (i * i != d && check(d / i - x)) cnt ++, sum += d / i - x;
    }
 
    std::cout << cnt << " " << sum << "\n";
}
signed main(){
	int t;
	cin>>t;
	while(t--){
		solve();
	}
}