#include <cstdio>
#include <algorithm>
using namespace std;

int C[10000], p, n;

int solve()
{
    scanf("%d",&n);
    int i;
    for (i=0; i<n; i++) scanf("%d",C+i);
    sort(C, C+n);
    int X=0;
    for (i=0; i<n; i++){
        if (C[i] <= X+1) X+=C[i];
        else return X+1;
    }
    return X+1;
}

int main()
{
    freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
    scanf("%d",&p);
    for (int t=0; t<p; t++) printf("%d\n",solve());
    return 0;
}