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

typedef long long ll;
const ll INF = 1e15;
const int N = 1e6+10;

vector<pair<ll,ll> >v[1001];

int n;
ll c,a[N],b[N],p[N];

ll dist(ll x,ll y){
    return min(max(y,x)-min(y,x),10-max(y,x)+min(y,x));
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n>>c;
    for(int i=1;i<=n;i++)cin>>p[i];
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++){
        cin>>b[i];
        v[p[i]].push_back({a[i],b[i]});
    }
    ll ans=0LL;
    for(int i=1;i<1001;i++){
        if(!v[i].size())continue;
        ll mncost=INF;
        for(int j=0;j<10;j++){
            ll cost=c;
            for(int k=0;k<v[i].size();k++){
                cost+=dist(v[i][k].second,1LL*j);
            }
            mncost=min(mncost,cost);
        }
        ll cost=0LL;
        for(int k=0;k<v[i].size();k++)cost+=dist(v[i][k].first,v[i][k].second);
        mncost=min(mncost,cost);
        ans+=mncost;
    }
    cout<<ans;


    return 0;
}


/*

8 3
6 5 6 5 5 6 1 2
5 1 5 2 3 5 8 0
0 1 0 2 3 8 4 8

*/