#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  int* a = new int[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  int num = 1;
  for (int i = n - 1; i >= 0; i--)
    if (a[i] <= i + 1) {
      num += i + 1;
      break;
    }
  cout << num << endl;
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
