#include <bits/stdc++.h>
int comp(const void *a, const void *b) {
  return *(const int *)a - *(const int *)b;
}
void solve() {
  long long int n, *nums, onground = 0, transit = 1;
  scanf("%lld", &n);
  nums = (long long int *)malloc(n * sizeof(long long int));
  for (int i = 0; i < n; i++) scanf("%lld", &nums[i]);
  qsort(nums, n, sizeof(long long int), comp);
  for (int i = 0; i < n; i++) {
    if (transit >= nums[i]) {
      onground = transit + 1;
    }
    transit++;
  }
  printf("%lld\n", onground > 0 ? onground : 1);
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    solve();
  }
  return 0;
}
