//加油!
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn = 1000 + 5;
int dp[maxn];
int w[maxn];
int v[maxn];
int main()
{
int T, N, V;
cin >> T;
while(T--)
{
memset(dp,0,sizeof(dp));
memset(w,0,sizeof(w));
memset(v,0,sizeof(v));
cin >> N >> V;
for(int i = 0; i < N; ++i) scanf("%d", &v[i]);
for(int i = 0; i < N; ++i) scanf("%d", &w[i]);
for(int i = 0; i < N; ++i)
{
for(int j = V; j >= w[i]; --j)
{
dp[j] = max(dp[j], dp[j-w[i]] + v[i]);
}
}
printf("%d\n", dp[V]);
}
return 0;
}