#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n, x;
    cin >> n >> x;
    vector<ll> a(n), b(n);
    rep(i, n) {
        cin >> a[i];
        a[i] -= x;
    }
    rep(i, n) cin >> b[i];
    vector<map<ll, ll>> dp(n + 1);
    rep(i, n) {
        dp[i + 1][a[i]] = b[i];
        for(auto &v : dp[i]) {
            if (dp[i + 1].count(v.first) == 0) {
                dp[i + 1][v.first] = v.second;
            }
            else {
                dp[i + 1][v.first] = min(dp[i + 1][v.first], v.second);
            }
            if (dp[i + 1].count(v.first + a[i]) == 0) {
                dp[i + 1][v.first + a[i]] = v.second + b[i];
            }
            else {
                dp[i + 1][v.first + a[i]] = min(dp[i + 1][v.first + a[i]], v.second + b[i]);
            }
        }
    }
    ll ans = LONG_LONG_MAX;
    if (dp[n].begin()->first >= 0) {
        ans = 0;
    }
    for(auto &v : dp[n]) {
        if (v.first < 0) continue;
        ans = min(ans, v.second);
    }
    cout << ((ans == LONG_LONG_MAX) ? -1 : ans) << endl;
    return 0;
}