#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::deque;
using std::get;
using std::greater;
using std::ifstream;
using std::ios_base;
using std::less;
using std::list;
using std::lower_bound;
using std::make_pair;
using std::make_tuple;
using std::map;
using std::max;
using std::max_element;
using std::min;
using std::min_element;
using std::multimap;
using std::multiset;
using std::ofstream;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::swap;
using std::tuple;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_set;
using std::upper_bound;
using std::vector;
[[maybe_unused]] const string endl = "\n";
[[maybe_unused]] const string sep = " ";
[[maybe_unused]] const string yes = "YES\n";
[[maybe_unused]] const string no = "NO\n";
[[maybe_unused]] const string ng = "NG\n";
[[maybe_unused]] const string ok = "OK\n";
[[maybe_unused]] const double pi = acos(-1);
[[maybe_unused]] const unsigned long long modular = 998244353;
template <class T>
T min(const T &a, const T &b, const T &c) {
  return min(a, min(b, c));
}
template <class T>
T max(const T &a, const T &b, const T &c) {
  return max(a, max(b, c));
}
vector<long long> lca_h, lca_dfs_list, lca_first, lca_tree;
vector<char> lca_dfs_used;
void lca_dfs(const vector<vector<long long>> &g, long long v, long long h = 1) {
  lca_dfs_used[v] = true;
  lca_h[v] = h;
  lca_dfs_list.push_back(v);
  for (auto i = g[v].begin(); i != g[v].end(); ++i)
    if (!lca_dfs_used[*i]) {
      lca_dfs(g, *i, h + 1);
      lca_dfs_list.push_back(v);
    }
}
void lca_build_tree(long long i, long long l, long long r) {
  if (l == r)
    lca_tree[i] = lca_dfs_list[l];
  else {
    long long m = (l + r) >> 1;
    lca_build_tree(i + i, l, m);
    lca_build_tree(i + i + 1, m + 1, r);
    if (lca_h[lca_tree[i + i]] < lca_h[lca_tree[i + i + 1]])
      lca_tree[i] = lca_tree[i + i];
    else
      lca_tree[i] = lca_tree[i + i + 1];
  }
}
void lca_prepare(const vector<vector<long long>> &g, long long root) {
  long long n = (long long)g.size();
  lca_h.resize(n);
  lca_dfs_list.reserve(n * 2);
  lca_dfs_used.assign(n, 0);
  lca_dfs(g, root);
  long long m = (long long)lca_dfs_list.size();
  lca_tree.assign(lca_dfs_list.size() * 4 + 1, -1);
  lca_build_tree(1, 0, m - 1);
  lca_first.assign(n, -1);
  for (long long i = 0; i < m; ++i) {
    long long v = lca_dfs_list[i];
    if (lca_first[v] == -1) lca_first[v] = i;
  }
}
long long lca_tree_min(long long i, long long sl, long long sr, long long l,
                       long long r) {
  if (sl == l && sr == r) return lca_tree[i];
  long long sm = (sl + sr) >> 1;
  if (r <= sm) return lca_tree_min(i + i, sl, sm, l, r);
  if (l > sm) return lca_tree_min(i + i + 1, sm + 1, sr, l, r);
  long long ans1 = lca_tree_min(i + i, sl, sm, l, sm);
  long long ans2 = lca_tree_min(i + i + 1, sm + 1, sr, sm + 1, r);
  return lca_h[ans1] < lca_h[ans2] ? ans1 : ans2;
}
long long lca(long long a, long long b) {
  long long left = lca_first[a], right = lca_first[b];
  if (left > right) swap(left, right);
  return lca_tree_min(1, 0, (long long)lca_dfs_list.size() - 1, left, right);
}
int main() {
  cin.tie(nullptr);
  cout.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  cout.precision(10);
  long long tests;
  cin >> tests;
  while (tests--) {
    long long n;
    cin >> n;
    vector<long long> A(n + 1);
    for (int i = 0; i < n; ++i) {
      cin >> A[i + 1];
    }
    sort(A.begin(), A.end());
    for (long long i = n; i >= 0; --i) {
      if (A[i] <= i) {
        cout << i + 1 << endl;
        break;
      }
    }
  }
}
