#include <bits/stdc++.h>
using namespace std;

#define all(v) (v).begin(),(v).end()
#define rep(i, n) for(int i=0;i<(n);i++)

using ll = long long;
const ll INF = (3LL << 59);

template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
    bool compare = a > b;
    if(compare) a = b;
    return compare;
}

void solve() {
    ll n, s; cin >> n >> s;
    assert(n <= 1000 and s <= 1000000 and n >= 1 and s >= 1);
    vector<ll> x(n);
    rep(i, n) cin >> x[i];
    rep(i, n - 1) assert(x[i + 1] > x[i]);
    assert(x[0] > 0 and x.back() <= 1000000);
    assert(count(all(x), s) == 0);
    vector<ll> w(n);
    rep(i, n) cin >> w[i];
    assert(*max_element(all(w)) <= 1000000 and *min_element(all(w)) > 0);
    vector dp(2, vector(n + 1, vector(2, INF)));

    vector<ll> sum(n + 1, 0);
    rep(i, n) sum[i + 1] = sum[i] + w[i];
    for(int l = n - 1; l >= 0; l --) {
        rep(j, n + 1) rep(k, 2) dp[1][j][k] = INF;
        rep(k, 2) chmin(dp[0][l + 1][k], abs(x[l] - s) * sum[n]);

        for(int r = l + 1; r <= n; r ++) {
            ll val = sum[n] - sum[r] + sum[l];
            if(r < n) {
                chmin(dp[0][r + 1][1], dp[0][r][0] + val * abs(x[l] - x[r]));
                chmin(dp[0][r + 1][1], dp[0][r][1] + val * abs(x[r - 1] - x[r]));
            }
            if(l > 0) {
                chmin(dp[1][r][0], dp[0][r][0] + val * abs(x[l] - x[l - 1]));
                chmin(dp[1][r][0], dp[0][r][1] + val * abs(x[r - 1] - x[l - 1]));
            }
        }
        if(l) swap(dp[0], dp[1]);        
    }
    cout << min(dp[0][n][0], dp[0][n][1]) << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int testcase = 1; 
    // cin >> testcase;
    while(testcase --) solve();

    return 0;
}