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

void solve() {
    ll n;
    cin >> n;
    vector<ll> minutes(n);
    vector<bool> finish(n, false);
    
    for (int i = 0; i < n; i++) cin >> minutes[i];

    ll current = 1;
    ll cnt = 0;
    ll biggest;
    ll lowest;

    for (int u = 0; u < n; u++) {
        biggest = -1;
        lowest = 1e18;
        for (int i = 0; i < n; i++) {
            if (finish[i]) continue;
            if (ceil(current / (float)minutes[i]) * minutes[i] < lowest) {
                lowest = ceil(current / (float)minutes[i]) * minutes[i];
                biggest = i;
            }
            if (ceil(current / (float)minutes[i]) * minutes[i] == lowest && minutes[i] > minutes[biggest]) {
                biggest = i;
            }
        }
        current = lowest;
        current ++;
        finish[biggest] = true;
    }
    cout << current - 1 << endl;





}







int main() {
    ll t;
    cin >> t;
    while (t--) solve();
}