#include <bits/stdc++.h>
using namespace std;
int main() {
  long long tc, n, x, cnt1, cnt2, i, max_;
  scanf("%lld", &tc);
  while (tc--) {
    scanf("%lld", &n);
    vector<long long> v;
    vector<long long> v1;
    for (i = 0; i < n; i++) {
      scanf("%lld", &x);
      v.push_back(x);
    }
    sort(v.begin(), v.end());
    cnt1 = 0;
    v1.push_back(0);
    for (i = 0; i < n; i++) {
      cnt1++;
      if (cnt1 >= v[i]) v1.push_back(i + 1);
    }
    max_ = *max_element(v1.begin(), v1.end());
    printf("%lld\n", max_ + 1);
  }
}
