#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
#include <array>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define whole(f,x,...) ([&](decltype((x)) y) { return (f)(begin(y), end(y), ## __VA_ARGS__); })(x)
typedef long long ll;
using namespace std;
template <class T> void setmin(T & a, T const & b) { if (b < a) a = b; }
const int W = 500;
const ll infty = ll(1e18)+9;
int main() {
    int n; ll m; scanf("%d%lld", &n, &m);
    vector<int> a(n); repeat (i,n) scanf("%d",   &a[i]);
    vector<ll>  k(n); repeat (i,n) scanf("%lld", &k[i]);
    ll x = whole(inner_product, a, k.begin(), 0ll) - m;
    ll ans = infty;
    if (x >= 0) {
        int l = min<ll>(3e5, x+1); // magic
        array<ll,W+2> dp = {};
        whole(fill, dp, infty);
        dp[0] = 0;
        repeat (acc,l) {
            int i = acc % dp.size();
            if (dp[i] == infty) continue;
            repeat (j,n) {
                setmin(dp[(i + a[j]) % dp.size()], dp[i] + 1);
                if ((x - acc) % a[j] == 0) {
                    setmin(ans, dp[i] + (x - acc) / a[j]);
                }
            }
            dp[i] = infty;
        }
    }
    if (ans == infty) ans = -1;
    printf("%lld\n", ans);
    return 0;
}