#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    long long int a[n];
    long long int freq[200001] = {0};
    for (long long int i = 0; i < n; i++) {
      cin >> a[i];
      freq[a[i]]++;
    }
    sort(a, a + n);
    long long int present = 1;
    long long int ans = 1;
    long long int expected = 0;
    long long int count = 0;
    int flag = 0;
    while (count < n) {
      expected = a[count];
      present += freq[a[count]] - 1;
      if (present >= expected) {
        ans = present + 1;
      }
      count += freq[a[count]];
      present += 1;
    }
    cout << ans << endl;
  }
  return 0;
}
