#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define endl '\n'
#define MAXN 50005
ll a[MAXN],b[MAXN];
void solve()
{
	ll n, k;
	cin >> n >> k;
	
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	
	sort(a + 1, a + n + 1);
	n = unique(a + 1, a + n + 1) - a - 1;
	

	if (n == 1) {
		cout << k << " " << k * (k + 1) / 2 << endl;	
		return;
	}
	
	ll x = a[n];
	map<ll, ll> mp, st;
	for (int i = 1; i <= n - 1; i++) {
		ll y = a[i];
		ll t = x - y;
		
		if (i == 1) {
			for (int j = 1; j <= t / j; j++) {
				if (t % j == 0) {
					if (j > y) {
						mp[j - y] = 1;
					}
					if (t / j != j) {
						if (t / j > y) {
							mp[t / j - y] = 1;
						} 
					}
				}
			}
		} else {
			for (auto k : mp) {
				if ((x + k.first) % (k.first + y) != 0) {
					mp[k.first] = 0;
				}
			}
		}
	}
	
	ll res = 0, cnt = 0;
	for (auto k : mp) {
		if (k.second != 0) {
			res += k.first;
			cnt++;
		}
	}
	
	cout << cnt << ' ' << res << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int t = 1;
	cin >> t;
	
	while (t--) {
		solve();
	}
	
	return 0;
}
/*
3
5 10
7 79 1 7 1
2 1000000000
1 2
1 100
1000000000
 */