#include <bits/stdc++.h>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;


const int N = 1e5 + 500;

int n, A[N], L;
vector < int > kand;
vector < pii > uvjet;

void filtriraj(int A, int B) {
	vector < int > nw;
	for(int x : kand) {
		if((B + x) % (A + x) == 0) nw.PB(x);
	}
	kand = nw;
}

void solve() {
	uvjet.clear(); kand.clear();
	scanf("%d%d", &n, &L);
	for(int i = 0;i < n;i++) {
		scanf("%d", A + i);
	}
	stack<int> S;
	for(int i = 0;i < n;i++) {
		while(!S.empty() && A[S.top()] >= A[i]) {
			if(A[S.top()] > A[i]) 
				uvjet.PB({A[i], A[S.top()]});
			S.pop();
		}
		S.push(i);
	}
	for(;!S.empty();S.pop());
	for(int i = n - 1;i >= 0;i--) {
		while(!S.empty() && A[S.top()] >= A[i]) {
			if(A[S.top()] > A[i]) 
				uvjet.PB({A[i], A[S.top()]});
			S.pop();
		}
		S.push(i);
	}
	if(uvjet.empty()) {
		printf("%d %lld\n", L, (ll)L * (L + 1) / 2);
		return;
	}
	int A = uvjet[0].Y - uvjet[0].X;
	for(int i = 1;i * i <= A && i <= L + uvjet[0].X;i++) {
		if(A % i == 0) {
			if(i > uvjet[0].X) kand.PB(i - uvjet[0].X);
			if(A / i < i && A / i <= L + uvjet[0].X && A / i > uvjet[0].X) 
				kand.PB(A / i - uvjet[0].X);
		}
	}
	for(auto &[A, B] : uvjet) filtriraj(A, B);
	ll sm = 0;
	for(int x : kand) sm += x;
	printf("%d %lld\n", (int)kand.size(), sm);
}

int main() {
	int T; scanf("%d", &T);
	for(;T--;) solve();
	return 0;
}