#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
void solve() {
  long long int n;
  cin >> n;
  map<long long int, long long int> m;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i], m[a[i]]++;
  long long int ans = 1, cur = 1;
  for (auto i : m) {
    if (cur + i.second - 1 >= (i.first)) {
      cur = cur + i.second;
      ans = cur;
    } else {
      cur = cur + i.second;
    }
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int __t;
  cin >> __t;
  while (__t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
