#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y >> 1;
    x = (x * x) % 1000000007;
  }
  return res;
}
long long int dp[1005][1005];
long long int a[400005], pre[400005], pre2[400005];
long long int maxProfit(long long int* price, long long int start,
                        long long int end, long long int n) {
  long long int y = n - (end - start + 1) + 1;
  if (dp[start][end] != -1) return dp[start][end];
  if (start > end) {
    return dp[start][end] = 0;
  }
  if (start == end) {
    return dp[start][end] = y * price[start];
  }
  return dp[start][end] =
             max(y * price[start] + maxProfit(price, start + 1, end, n),
                 y * price[end] + maxProfit(price, start, end - 1, n));
}
long long int sum(long long int l, long long int r) {
  return r * (r + 1) / 2 - l * (l + 1) / 2;
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> arr(n);
  for (long long int i = 0; i < n; i++) cin >> arr[i];
  sort(arr.begin(), arr.end());
  long long int ans = 0;
  for (long long int i = n - 1; i >= 0; i--) {
    if (i + 1 >= arr[i]) {
      ans = i + 1;
      cout << ++ans << "\n";
      return;
    }
  }
  cout << 1 << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  ;
  long long int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
