// Source: https://usaco.guide/general/io

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

#define int long long

const int inf=1e9;

int power(int a,int b){
    if(b==0)return 1;
    return power(a,b-1)*a;
}

signed main() {
    int n,k;cin>>n>>k;
    vector<int> db(k);
    for(int i = 0;i<k;i++)cin>>db[i];
    vector<int> akar(n);
    for(int i = 0;i<n;i++)cin>>akar[i];
    vector<int> cost(n);
    for(int i = 0;i<n;i++)cin>>cost[i];



    vector<vector<pair<int,int>>> full(k);
    for(int i = 0;i<n;i++){
        akar[i]--;
        full[akar[i]].push_back({cost[i],i});
    }
    for(int i = 0;i<k;i++){
        sort(full[i].rbegin(),full[i].rend());
    }/*// debug kiiras
    for(int i = 0;i<k;i++){
        for(auto j:full[i])cout<<j.second<<' ';
        cout<<endl;
    }*/
    vector<int> ans(n,-1),dbb;
    dbb=db;
    for(int i = 0;i<k;i++){
        for(int j = 0;j<min(db[i],(int)full[i].size());j++){
            ans[full[i][j].second]=i;
            dbb[i]--;
        }
    }
    db=dbb;
    stack<pair<int,int>> s;
    for(int i = 0;i<k;i++){
        if(db[i]>0){
            s.push({i,db[i]});
            //cerr<<i<<' '<<db[i]<<endl;
        }
    }
    int cryingsimulatortime=0;
    for(int i = 0;i<n;i++){
        if(ans[i]==-1){
            cryingsimulatortime+=cost[i];// >:)
            ans[i]=s.top().first-1;
            s.top().second--;
            if(s.top().second==0)s.pop();
        }
    }
    cout<<cryingsimulatortime<<endl;
    for(int i = 0;i<n;i++)cout<<ans[i]+1<<' ';
}