#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
int T, n, a[maxn];
int main() {
  cin >> T;
  while (T--) {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + 1 + n);
    int sign = 0;
    for (int i = n; i >= 1; i--) {
      if (a[i] <= i) {
        sign = i;
        break;
      }
    }
    if (!sign) {
      printf("1\n");
    } else {
      printf("%d\n", sign + 1);
    }
  }
  return 0;
}
