#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#include <limits>
#include <map>
#include <cstdlib>
#include <cmath>
#include <set>
#include <bitset>
#include <string>
#include <iomanip>
#include <deque>
#include <set>

using namespace std;

int main(){
    //freopen("phoneline.in", "r", stdin); freopen("phoneline.out", "w", stdout);
    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios::sync_with_stdio(false);

    int n, k;
    cin >> n >> k;
    vector<int> m(n);
    vector<int> c(n);

    for(int i = 0; i < n; i++)
        cin >> m[i];

    for(int i = 0; i < n; i++)
        cin >> c[i];

    int last = 0;
    int b[1000001];

    for(int i = 0; i < 1000001; i++)
        b[i] = -1;
    b[0] = 0;

    for(int i = 0; i < n; i++){
        for(int j = last; j >= 0; j--){
            if(b[j] != -1){
                b[j+m[i]] = max(b[j+m[i]], b[j] + c[i]);
                if(j+m[i] > last)
                    last = j+m[i];
            }
        }
    }

    int mx = 0;
    for(int i = 1; i <= k; i++)
        if(b[i] > mx)
            mx = b[i];

    cout << mx;

    return 0;
}