#include<cstdio>

#include<cstring>

#include<algorithm>

#define maxn 505

using namespace std;

int f[maxn];

int cot[maxn];

int num[maxn];

int main()

{

    int n,m,t;

    scanf("%d",&t);

    while(t--)

    {

        int mi=<<;

        scanf("%d%d",&n,&m);

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

        {

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

            mi=min(mi,num[i]);

        }

        if(m<mi)

        {

            puts("Sorry, you can't buy anything.");

            continue;

        }

        memset(f,,sizeof f);

        memset(cot,,sizeof cot);

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

            cot[i]=;

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

        {

            for(int j=m; j>=num[i]; j--)

            {

                if(f[j]==f[j-num[i]]+)

                    cot[j]+=cot[j-num[i]];

                else if(f[j]<f[j-num[i]]+)

                {

                    cot[j]=cot[j-num[i]];

                }

                f[j]=max(f[j],f[j-num[i]]+);

//                printf("%d %d|  ",f[j],cot[j]);

            }

//            puts("");

        }

        printf("You have %d selection(s) to buy with %d kind(s) of souvenirs.\n",cot[m],f[m]);

    }

    return ;

}