#include <cmath>

 #include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 typedef long long LL;

 const int mod = ;

 const int maxn = ;

 int dp[][maxn], a[], c[];

 int main ()

 {

     int T;

     scanf ("%d", &T);

     for (int t=; t<=T; t++)

     {

         int n, k;

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

         memset (dp, , sizeof(dp));

         dp[][] = ;

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

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

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

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

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

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

                 for (int x=k; x>=a[i]*j; x--)

             {

                 dp[i][x] = (dp[i][x] + dp[i-][x-a[i]*j]) % mod;

             }

         printf ("Case %d: %d\n", t, dp[n][k]);

     }

     return ;

 }