#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

#define maxn 2000010

int dp[maxn];

int main()

{

    int t,w[];

    scanf("%d",&t);

    while(t--)

    {

        for(int i = ;i < ;i++)

            scanf("%d",&w[i]);

        memset(dp,0x3f,sizeof(dp));

        dp[] = ;

        int all = ;

        for(int i = ;i < ;i++)

        {

            for(int j = w[i];j < all;j++)

                dp[j] = min(dp[j],dp[j-w[i]] + );

        }

        int sum = ,ans = ;

        for(int i = ;i <= ;i++)

        {

            if(dp[i] >= 0x3f3f3f)

            {

                sum++;

                ans = i;

            }

        }

        bool mark = true;

        for(int i = ;i <= ;i++)

        {

            if(dp[i] >= 0x3f3f3f)

            {

                mark = false;

                break;

            }

        }

        if(mark)

        printf("%d\n%d\n",sum,ans);

        else printf("%d\n%d\n",sum,-);

    }

    return ;

}