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