#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> vec(n);
    for (int i = 0; i < n; i++) cin >> vec[i];
    sort(vec.begin(), vec.end());
    int i = vec.size() - 1;
    for (; i >= 0; i--) {
      if (i + 1 >= vec[i]) break;
    }
    cout << i + 2 << endl;
  }
  return 0;
}
