//题意自己看，不会度娘
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main(int argc, char *argv[])
{int i,j;int t,n,v,n1[1005],v1[1005];int a[1005][1005];scanf("%d",&t);while(t--){memset(a,0,sizeof(a));memset(n1,0,sizeof(n1));memset(v1,0,sizeof(v1));//数组清零 scanf("%d %d",&n,&v);//输入体积和价值 for(i=1;i<=n;i++)scanf("%d",&n1[i]);for(i=1;i<=n;i++)scanf("%d",&v1[i]);//数据输入 for(i=1;i<=n;i++)//每个物品循环过去 {for(j=0;j<=v;j++)//体积从0开始 {if(j>=v1[i])//如果现在的体积能放下第i个物品就开始比较 {a[i][j]=max(a[i-1][j],a[i-1][j-v1[i]]+n1[i]);printf("**i=%d,j=%d,a[i][j]=%d ",i,j,a[i][j]); }else//不能放入第i个物品就找上一次的最优解 a[i][j]=a[i-1][j];} printf("\n");}printf("%d\n",a[n][v]); }return 0;
}
//Start-ZJ
//2017/12/21/19:31