#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long mx = 2e6;
vector<bool> pr(mx, 1);
void sv() {
  pr[1] = 0;
  for (long long n = 2; n * n <= mx; n++) {
    if (pr[n]) {
      for (long long k = 2 * n; k < mx; k += n) pr[k] = 0;
    }
  }
}
long long bit[mx];
void up(long long ind, long long vl) {
  while (ind < mx) {
    bit[ind] += vl;
    ind += ind & (-ind);
  }
}
long long qr(long long ind) {
  long long res = 0;
  while (ind) {
    res += bit[ind];
    ind -= ind & (-ind);
  }
  return res;
}
void solve() {
  long long x;
  scanf("%lld", &(x));
  vector<long long> s(x);
  for (int n = 0; n < x; n++) scanf("%lld", &(s[n]));
  sort(s.begin(), s.end());
  long long ct = 1;
  long long res = 1;
  bool prov = 1;
  long long v = 0;
  vector<long long> dp(x, 0);
  for (int n = 0; n < x; n++) {
    long long p = s[n] - 1;
    dp[n] = p;
  }
  for (long long n = x - 1; n >= 0; n--) {
    if (dp[n] <= n) {
      printf("%lld\n", (n + 2));
      return;
    }
  }
  cout << 1 << '\n';
}
int main() {
  long long t;
  scanf("%lld", &(t));
  for (long long n = 1; n <= t; n++) solve();
}
