#include <bits/stdc++.h>
using namespace std;
int jai_shree_ram() { return 1; }
int shree_ganeshay_namah() { return 1; }
long long int power(long long int x, long long int y) {
  long long int r = 1;
  while (y > 0) {
    if (y % 2 != 0) r = r * x;
    x = x * x;
    y = y / 2;
  }
  return r;
}
long long int ncr(long long int n, long long int k) {
  long long int c[k + 1];
  memset(c, 0, sizeof(c));
  c[0] = 1;
  for (long long int i = 1; i <= n; i++) {
    for (long long int j = min(i, k); j > 0; j--) c[j] = c[j] + c[j - 1];
  }
  return c[k];
}
bool prime[500001];
void sieve() {
  long long int i, j;
  memset(prime, true, sizeof(prime));
  prime[0] = false;
  prime[1] = false;
  for (i = 2; i <= sqrt(100001); i++) {
    if (prime[i]) {
      for (j = i * i; j <= 100001; j = j + i) prime[j] = false;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t, n, i, j;
  cin >> t;
  while (t--) {
    cin >> n;
    long long int first = 1;
    long long int a[n], x = 0;
    map<long long int, long long int> m;
    for (i = 0; i < n; i++) {
      cin >> a[i];
      m[a[i]]++;
    }
    sort(a, a + n);
    for (i = 0; i < n; i++) {
      if (a[i] <= i + 1) x = i + 1;
    }
    cout << x + 1 << "\n";
  }
  return 0;
}
