LOJ 1233

#include<bits/stdc++.h>
using namespace std;

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")

typedef unsigned long long ull;
typedef long long          ll;
typedef long double        lld;
typedef vector<int>        vi;
typedef vector<ll>         vll;
typedef vector<vi>         vvi;
typedef pair<int,int >     pii;
typedef pair<ll,ll >       pll;
typedef vector< pii >      vpii;
typedef vector< pll >      vpll;
typedef set<int>           sti;

#define sc                 scanf
#define pf                 printf
#define sci(n)             scanf("%d",&n)
#define scii(n,m)          scanf("%d %d",&n,&m)
#define scl(n)             scanf("%lld",&n)
#define scd(n)             scanf("%lf",&n)
#define scs(s)             scanf("%s",s)
#define pfi(n)             printf("%d",n)
#define pfl(n)             printf("%lld",n)
#define pff(n)             cout<<n
#define spc                printf(" ")
#define line               printf("\n")
#define loop(i,x,y)        for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)       for(int i=int(y); i>=int(x); i--)
#define cspf(i)            printf("Case %d: ", i)
#define vout(v)            for(int w=0;w<v.size();w++){if(w) cout<<' '; cout<<v[w];}
#define clr(a,x)           memset(a,x,sizeof(a))
#define tp(v,j)            get<j>(v)
#define pb                 push_back
#define mp                 make_pair
#define mt                 make_tuple
#define ff                 first
#define ss                 second
#define all(v)             v.begin(),v.end()
#define rall(v)            v.rbegin(),v.rend()
#define read()             freopen("input.txt", "r", stdin)
#define write()            freopen("output.txt", "w", stdout)
#define fastIO()           {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
/// Constants
#define eps                1e-6
#define PI                 acos(-1.0)  // 3.1415926535897932
#define MAX                1e9
#define MAXn               100000
#define MOD                100000007

int GCD(int a, int b) { return b == 0 ? a : GCD(b , a % b); }
ll LCM(ll a, ll b) { return a * (b/GCD(a, b)); }


bool dp[MAXn+5];
vi pre,cur;
int coin[105],freq[105],n,m;

void Build()
{
    for(int i=0;i<=m;i++){
        if(dp[i]) pre.pb(i);
    }
}

void solve()
{
    pre.clear();
    dp[0]=1;
    for(int i=0;i<n;i++){
        Build();
        cur.clear();
        for(int j=0;j<freq[i];j++){
            for(int k=0;k<pre.size();k++){
                int make = pre[k]+coin[i];
                if(make>m) continue;
                if(!dp[make]){
                    dp[make]=1;
                    cur.pb(make);
                }
            }
            pre=cur;
        }
    }
}

int main()
{
    #ifdef VAMP
        clock_t tStart = clock();
       freopen("input.txt", "r", stdin);
       freopen("output.txt", "w", stdout);
    #endif

    int t,ca=0;
    sci(t);
    while(t--){
        clr(dp,0);
        clr(freq,0);
        scii(n,m);
        for(int i=0;i<n;i++){
            sci(coin[i]);
        }
        for(int i=0;i<n;i++){
            sci(freq[i]);
            freq[i]=min(freq[i],m/coin[i]);
        }
        solve();
        int cnt=0;
        for(int i=1;i<=m;i++){
            if(dp[i]) cnt++;
        }
        cspf(++ca);pfi(cnt);line;
    }

    #ifdef VAMP
        fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
    #endif

    return 0;
}