#include <iostream>
#include <vector>

using std::vector;
using std::endl;
using std::cout;
using std::cin;

int n,bagweight;


void solve(){
    vector<int> weight(n,0);
    vector<int> value(n,0);

    for(int i = 0;i<n;i++){
        cin>>weight[i];
    }
    for(int j = 0;j<n;j++){
        cin>>value[j];
    }

    vector<vector<int>> dp(weight.size(),vector<int>(bagweight+1,0));//初始化dp数组

    for(int j = weight[0];j<=bagweight;j++){
        dp[0][j] = value[0];
    }

    for(size_t i = 1;i<weight.size();i++){
        for(int j = 0;j<=bagweight;j++){
            if(j <weight[i]){
                dp[i][j]  = dp[i-1][j];
            }else{
                dp[i][j] = std::max(dp[i-1][j],dp[i-1][j-weight[i]]+value[i]);
            }
        }
    }
}

int main(){
    while(cin>>n>>bagweight){
        solve();
    }
}