#include <bits/stdc++.h>
using namespace std;
using LL = long long;

void solve() {

	int n,k;
	cin >> n >> k;

	vector<int> a(n + 2) , logn(n + 1);
	logn[0] = -1;
	for (int i = 1 ; i <= n ; ++i) {
		cin >> a[i];
		logn[i] = logn[i >> 1] + 1;
	}
	a[0] = a[n + 1] = -1;

	if (n == 1) {
		cout << k << " " << 1LL * k * (k + 1) / 2 << "\n";
		return;
	}

	vector<int> stk;
	stk.emplace_back(0);

	vector<int> l(n + 1);
	for (int i = 1 ; i <= n ; ++i) {
		while (!stk.empty() && a[stk.back()] >= a[i]) {
			stk.pop_back();
		}
		l[i] = stk.back();
		stk.emplace_back(i);
	}

	while (!stk.empty()) stk.pop_back();
	stk.emplace_back(n + 1);
	vector<int> r(n + 1);
	for (int i = n ; i >= 1 ; --i) {
		while (!stk.empty() && a[stk.back()] >= a[i]) {
			stk.pop_back();
		}
		r[i] = stk.back();
		stk.emplace_back(i);
	}

	constexpr int M = 20;
	vector dp(n + 1 , vector<int>(M));
	for (int i = 2 ; i <= n ; ++i) {
		dp[i][0] = abs(a[i] - a[i - 1]);
	}
	for (int j = 1 ; j < M ; ++j) {
		for (int i = 2 ; i + (1 << j) - 1 <= n ; ++i) {
			dp[i][j] = __gcd(dp[i][j - 1] , dp[i  + (1 << (j - 1))][j - 1]);
		}
	}
	auto query = [&] (int l,int r) {
		int len = logn[r - l + 1];
		return __gcd(dp[l][len] , dp[r - (1 << len) + 1][len]);
	};

	int res = 0;
	map<int,int> mp;
	for (int i = 1 ; i <= n ; ++i) {
		int L = l[i] + 1 , R = r[i] - 1;
		if (L == R) continue;
		
		++res;
		int g = query(L + 1 , R);

		auto check = [&] (int j) {
			int x = j - a[i];
			if (x < 1 || x > k) return false;
			if (__gcd(a[L] + x , g) != a[i] + x) return false;
			return true;
		};

		for (int j = 1 ; j * j <= g ; ++j) {
			if (g % j == 0) {
				if (check(j)) mp[j - a[i]] += 1;
				if (j * j != g) {
					int j_ = g / j;
					if (check(j_)) mp[j_ - a[i]] += 1;
				}
			}
		}
	}

	if (res == 0) {
		cout << k << " " << 1LL * k * (k + 1) / 2 << "\n";
		return;
	}

	LL ans = 0;
	int cnt = 0;
	for (auto [val , num] : mp) {
		if (num == res) {
			ans += val;
			cnt ++;
		}
	}

	cout << cnt << " " << ans << "\n";
}

int main() {

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}