#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define ll long long
#define _cle(m, a) memset(m, a, sizeof(m))
#define repu(i, a, b) for(int i = a; i < b; i++)
#define repd(i, a, b) for(int i = b; i >= a; i--)
#define sfi(n) scanf("%d", &n)
#define sfl(n) scanf("%I64d", &n)
#define pfi(n) printf("%d\n", n)
#define pfl(n) printf("%I64d\n", n)
#define MAXN 1005
int dp[MAXN];
int v[MAXN];
int p[MAXN];
int main()
{
    int T;
    sfi(T);
    while(T--)
    {
        _cle(dp, 0);
        int n, m;
        sfi(n), sfi(m);
        repu(i, 0, n) sfi(p[i]);
        repu(i, 0, n) sfi(v[i]);
        repu(i, 0, n)
        for(int j = m; j >= v[i]; j--)
            dp[j] = max(dp[j], dp[j - v[i]] + p[i]);
        pfi(dp[m]);
    }
    return 0;
}