#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using vi = vector<int>;
using ii = pair<int, int>;
using ll = long long;
using vll = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
ll gcd(ll a, ll b) {return a == 0 ? b : gcd(b % a, a);}
int N;
const int M = 1e6;
void ckmin(pll &a, pll b) {
    if (a.first * b.second > a.second * b.first) 
        a = b;
}

ll mx[2 * M], mn[2 * M];

void modify(int p, int value) {  
    int v = p;
  for (mx[v += N] = value; v > 1; v >>= 1) mx[v>>1] = max(mx[v] , mx[v^1]);
  v = p;
  for (mn[v += N] = value; v > 1; v >>= 1) mn[v>>1] = min(mn[v] , mn[v^1]);
}

pll query(int l, int r) {  // sum on interval [l, r)
  ll ma = 0, mi = 1e9;
  for (l += N, r += N; l < r; l >>= 1, r >>= 1) {
    if (l&1) {
        mi = min(mi, mn[l]);
        ma = max(ma, mx[l++]);
    }
    if (r&1) {
        mi = min(mi, mn[r - 1]);
        ma = max(ma, mx[--r]);
    }
  }
  return {ma, mi};
}


pll solve(vll &nums, ll x, int k) {
    if (k == 1) return {1e9, 1};
    memset(mx, 0, 2 * k);
    memset(mn, 0, 2 * k);
    N = k;
    vll sum(k);
    int n = nums.size() + 1;
    int cur = 1;
    rep(i, 0, n - 1) {
        sum[cur++] += nums[i];
        if (cur == k) cur = 0;
    }

    sum[0] += x;

    rep(i, 0, k)
        modify(i, sum[i]);

    pll ans = query(0, k);
    cur = 0;
    int nx = 1;
    rep(i, 0, n - 1) {
        sum[cur] += nums[i];
        sum[cur] -= x;
        sum[nx] -= nums[i];
        sum[nx] += x;
        modify(cur, sum[cur]);
        modify(nx, sum[nx]);
        ckmin(ans, query(0, k));
        cur++;
        nx++;
        if (cur == k) cur = 0;
        if (nx == k) nx = 0;
    }
    return ans;
}

void solve() {
    int n; ll x;
    cin >> n >> x;
    vll nums(n - 1); rep(i, 0, n - 1) cin >> nums[i];

    pll ans = {1e9, 1};
    vi prime(n + 1, 1);
    for (int i = 2; i <= n; i++) {
        if (!prime[i]) continue;
        for (int j = 2 * i; j <= n; j+= i)  
            prime[j] = 0;
        
        if (n % i == 0)
            ckmin(ans, solve(nums, x, i));
    }

    ll g = gcd(ans.first, ans.second);
    cout << ans.first / g << " " << ans.second / g << "\n";
}

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