#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll INF=1e18+1;
ll gcd(ll a, ll b){
    if(b==0) return a;
    return gcd(b, a%b);
}
int main()
{
	int n; ll m;
	cin>>n>>m;
	ll a[500];
	for(int i=0; i<n; i++) cin>>a[i];
	ll g=a[0];
	for(int i=1; i<n; i++) g=gcd(a[i], g);
	for(int i=0; i<n; i++) a[i]/=g;
	if(m%g!=0){
	    cout<<-1<<endl;
	    return 0;
	}
	m/=g;
	ll s=0;
	for(int i=0; i<n; i++){
		ll k; cin>>k;
		s+=(a[i]*k);
	}
	if(s<m){
		cout<<-1<<endl;
		return 0;
	}
	s-=m;
	ll dp[2500001];
	fill(dp, dp+2500000, INF);
	dp[0]=0;
	for(int i=0; i<n-1; i++){
		for(int j=0; j<=2500000-a[i]; j++){
			dp[j+a[i]]=min(dp[j]+1, dp[j+a[i]]);
		}
	}
	ll ans=INF;
	for(ll i=s%a[n-1]; i<=min(2500000ll, s); i+=a[n-1]){
		if(dp[i]==INF) continue;
		ans=min(ans, dp[i]+(s-i)/a[n-1]);
	}
	if(ans<INF) cout<<ans<<endl;
	else cout<<-1<<endl;
	return 0;
}