#include <bits/stdc++.h>
#define int long long
using namespace std;
using ll = long long;

int INF = 1LL << 60;
const int N = 1e5 + 11, M = 4e3 + 11;
int cur[M], nxt[M];
int c[N], p[N];
void solve() {
    int n, S; cin >> n >> S;
    vector<pair<int, int>> A;
    for (int i = 0; i < n; i++) {
        cin >> c[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> p[i];
    }
    for (int i = 0; i < n; i++) {
        A.push_back({c[i], p[i]});
    }
    sort(A.begin(), A.end(), [](auto a, auto b){
        return a.second > b.second;
    });
    
    fill(cur, cur + M, INF); cur[0] = 0;

    for (int i = 0; i < n; i++) {
        fill(nxt, nxt + M, INF);
        nxt[0] = 0;
        for (int j = 1; j < M; j++) {
            nxt[j] = min(nxt[j], cur[j]);
            nxt[j] = min(nxt[j], cur[j - 1] + A[i].first + (j - 1) * A[i].second);
        }
        swap(cur, nxt);
    }

    int ans = 0;
    for (int i = 0; i < M; i++) {
        if (cur[i] <= S) ans = i;
    }
    cout << ans << endl;
}

signed main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int T = 1;
    // cin >> T;
    while (T--) solve();
}