#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int testcases;
  cin >> testcases;
  while (testcases--) {
    int n;
    cin >> n;
    deque<int> dq;
    int x;
    for (int i = 0; i < n; i++) cin >> x, dq.push_back(x);
    sort(dq.begin(), dq.end());
    long long int count = 0;
    int i = 0;
    int res = INT_MIN;
    for (i = 0; i < n; i++) {
      if (dq[i] <= i + 1) res = max(res, i + 1);
    }
    if (res < 0)
      cout << 1 << endl;
    else {
      cout << res + 1 << endl;
    }
  }
  return 0;
}
