#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N; long long M;
	while(~scanf("%d%lld", &N, &M)) {
		vector<int> A(N);
		for(int i = 0; i < N; ++ i)
			scanf("%d", &A[i]);
		long long sum = 0;
		for(int i = 0; i < N; ++ i) {
			long long K;
			scanf("%lld", &K);
			sum += K * A[i];
		}
		if(sum < M) {
			puts("-1");
			continue;
		}
		int X = A[N - 1];
		vector<vi> dp(X+1, vi(X, INF));
		dp[0][0] = 0;
		rep(i, X) rep(j, X) {
			int x = dp[i][j];
			if(x == INF) continue;
			rep(k, N) {
				int nj = j + A[k];
				if(nj < X) {
					amin(dp[i][nj], x + 1);
				} else {
					amin(dp[i + 1][nj - X], x);
				}
			}
		}
		long long Y = sum - M;
		long long quot = Y / X;
		int rem = Y % X;
		long long ans = INFL;
		rep(i, X) if(i <= quot) {
			int t = dp[i][rem];
			if(t < INF)
				amin(ans, t + quot);
		}
		if(ans == INFL)
			puts("-1");
		else
			printf("%lld\n", ans);
	}
	return 0;
}