#include <iostream>
using namespace std;

constexpr int N2 = 250010;
int dp[N2] = {0};
int A[501] = {0};
long long K[501] = {0};


int main()
{
    int N;
    long long M;
    cin >> N >> M;
    for (int i = 0; i != N; ++i) cin >> A[i];
    for (int i = 0; i != N; ++i) cin >> K[i];
    long long X = 0;
    for (int i = 0; i != N; ++i) X += A[i] * K[i];
    X -= M;
    if (X < 0){
        cout << - 1 << endl;
        return 0;
    }else if (X == 0){
        cout << 0 << endl;
        return 0;
    }
    for (int i = 0; i != N; ++i){
        int a = A[i];
        dp[a] = 1;
        int limit = N2 - a;
        for (int j = 1; j != limit; ++j){
            if (dp[j] and (dp[j] + 1 < dp[j + a] or not dp[j + a])){
                dp[j + a] = dp[j] + 1;
            }
        }
    }
    if (X < N2){
        if (dp[X] == 0){
            cout << - 1 << endl;
        }else{
            cout << dp[X] << endl;
        }
        return 0;
    }
    
    // X = maxA * k + residue
    // 0 <= X - maxA * k < N2
    // maxA * k <= X < N2 + maxA * k
    // (X - N2)/maxA < k <= X / maxA
    int maxA = A[N - 1];
    long long min_coins = X + 1;
    for (long long k = (X - N2)/maxA + 1; k * maxA <= X; ++k){
        int coins = dp[X - k * maxA];
        if (coins and coins + k < min_coins) min_coins = coins + k;
    }
    if (min_coins == X + 1){
        cout << - 1 << endl;
    }else{
        cout << min_coins << endl;
    }
    return 0;
}