1 #include <cstdio>
 2 #include <cmath>
 3 #include <cstring>
 4 #include <algorithm>
 5 using namespace std;
 6 
 7 //dp[i][j]表示放入第i块骨头并占用j体积的最大价值，
 8 //c[i]表示第i块骨头的体积
 9 //w[i]表示第i块骨头的价值
10 
11 int dp[1111][1111],c[1111],w[1111];
12 int T,N,V;
13 
14 int main ()
15 {
16     int i,j;
17     scanf ("%d",&T);
18     while (T--)
19     {
20         scanf ("%d%d",&N,&V);
21         for (i=1; i<=N; i++)
22         scanf ("%d",&w[i]);
23         for (i=1; i<=N; i++)
24         scanf ("%d",&c[i]);
25         memset(dp, 0, sizeof(dp));
26         for (i=1; i<=N; i++)
27         {
28             for (j=0; j<=V; j++)
29             {
30                 dp[i][j] = dp[i-1][j];   //这里主要考虑j小于c[i]时放不下第i块骨头
31                 if (j >= c[i])
32                 dp[i][j] = max(dp[i-1][j], dp[i-1][j-c[i]]+w[i]);
33             }
34         }
35         printf ("%d\n",dp[N][V]);
36     }
37     return 0;
38 }