#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main(){
    ll N, S;
    cin >> N >> S;
    vector<ll> X(N);
    vector<ll> W(N);
    rep(i, N){
        cin >> X[i];
    }
    rep(i, N){
        cin >> W[i];
    }
    // 区間 DP をしましょう
    vector<pll> p(N + 1);
    rep(i, N){
        p[i] = make_pair(X[i], W[i]);
    }
    p[N] = make_pair(S, 0);
    sort(all(p));
    ll sid = -1;
    for (ll i = 0; i <= N; i++){
        if (p[i].first == S) sid = i;
    }
    // 区間の累積和を求める
    vector<vector<ll>> seg_sum(N + 1, vector<ll>(N + 1, 0));
    for (ll i = 0; i <= N; i++){
        seg_sum[i][i] = p[i].second;
        for (ll j = i + 1; j <= N; j++){
            seg_sum[i][j] = seg_sum[i][j - 1] + p[j].second;
        }
    }
    // debug(seg_sum);
    ll INF = 2400000000000000002LL;
    vector<vector<vector<ll>>> dp(N + 1, vector<vector<ll>>(N + 1, vector<ll>(2, INF)));
    dp[sid][sid][0] = 0;
    dp[sid][sid][1] = 0;
    for (ll k = 0; k < N; k++){
        for (ll i = 0; i + k <= N; i++){
            // 左へ
            if (i > 0){
                dp[i - 1][i + k][0] = min(dp[i - 1][i + k][0], dp[i][i + k][0] + (seg_sum[0][N] - seg_sum[i][i + k]) * abs(p[i - 1].first - p[i].first));
                dp[i - 1][i + k][0] = min(dp[i - 1][i + k][0], dp[i][i + k][1] + (seg_sum[0][N] - seg_sum[i][i + k]) * abs(p[i - 1].first - p[i + k].first));
            }
            if (i + k < N){
                dp[i][i + k + 1][1] = min(dp[i][i + k + 1][1], dp[i][i + k][0] + (seg_sum[0][N] - seg_sum[i][i + k]) * abs(p[i + k + 1].first - p[i].first));
                dp[i][i + k + 1][1] = min(dp[i][i + k + 1][1], dp[i][i + k][1] + (seg_sum[0][N] - seg_sum[i][i + k]) * abs(p[i + k + 1].first - p[i + k].first));
            }
        }
    }
    ll ans = min(dp[0][N][0], dp[0][N][1]);
    cout << ans << endl;
}