#include <cstdio>

#include <cstring>

#include <cmath>

#include <iostream>

#include <algorithm>

#include <queue>

#include <cstdlib>

#include <stack>

#include <vector>

#include <set>

#include <map>

#define LL long long

#define mod 1000000007

#define inf 0x3f3f3f3f

#define N 1000010

#define clr(a) (memset(a,0,sizeof(a)))

using namespace std;

int dp[][],a[];

int n,m;

int main()

{

    int T;

    scanf("%d",&T);

    while(T--)

    {

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

        for(int i=;i<=n;i++)scanf("%d",&a[i]);

        clr(dp);

        dp[][]=;

        int mx=;

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

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

        {

            for(int k=n-;k>=;k--)

            {

                if(dp[j-a[i]][k])dp[j][k+]+=dp[j-a[i]][k],mx=max(mx,k+);

            }

        }

        if(mx==)

        {

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

            continue;

        }

        int ans=;

        for(int i=;i<=m;i++)ans+=dp[i][mx];

        printf("You have %d selection(s) to buy with %d kind(s) of souvenirs.\n",ans,mx);

    }

}