#include <bits/stdc++.h>
using namespace std;
long long expo(long long x, long long n, long long m) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return expo((x * x) % m, n / 2, m);
  else
    return (x * expo((x * x) % m, (n - 1) / 2, m)) % m;
}
string toBinary(long long n) {
  std::string r;
  while (n != 0) {
    r = (n % 2 == 0 ? "0" : "1") + r;
    n /= 2;
  }
  return r;
}
void solve() {
  long long ans = 0;
  long long n;
  cin >> n;
  map<long long, long long> m;
  for (long long i = 0; i < n; i++) {
    long long t;
    cin >> t;
    m[t]++;
  }
  ans = (long long)1;
  map<long long, long long>::iterator it = m.begin();
  long long last = 0;
  for (; it != m.end(); it++) {
    long long a = it->first;
    long long b = it->second;
    b += last;
    if (ans + b - 1 >= a) {
      ans += b;
      last = 0;
    } else
      last = b;
  }
  cout << ans << endl;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
