#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    vector<int> maxi(k + 1), w(n + 1), cry(n + 1), used(k + 1);
    for(int i = 1; i <= k; i++)
    {
        cin >> maxi[i];
    }
    vector<vector<pair<int, int> > > r(k + 1);
    for(int i = 1; i <= n; i++) cin >> w[i];
    for(int i = 1; i <= n; i++) cin >> cry[i];
    vector<pair<int, int> > all;
    for(int i = 1; i <= n; i++)
    {
        r[w[i]].push_back({cry[i], i});
    }
    vector<int> ans(n + 1);
    int sum = 0;
    for(int i = 1; i <= k; i++)
    {
        int a = r[i].size();
        used[i] = min(maxi[i], a);
        sort(r[i].begin(), r[i].end(), greater<pair<int, int> >());
        for(int j = 0; j < min(maxi[i], a); j++)
        {
            all.push_back(r[i][j]);
            ans[r[i][j].second] = i;
        }
        for(int j = maxi[i]; j < r[i].size(); j++)
        {
            all.push_back({0, r[i][j].second});
            sum += r[i][j].first;
        }
    }
    sort(all.begin(), all.end());
    int c = 0;
    int z = 1;

    while(z <= k)
    {
        while(used[z] > 0 && z <= k) z++;
        if(z > k) break;
        while(all[c].first != 0 && used[w[all[c].second]] <= 1)
        {
            c++;
        }
        used[z]++;
        int ind = all[c].second;
        if(all[c].first != 0)
        {
            used[w[ind]]--;
            sum += all[c].first;
        }
        ans[ind] = z;
    }
    int l = 1;
    cout << sum << "\n";
    for(int i = 1; i <= n; i++)
    {
        if(ans[i] == 0)
        {
            while(used[l] == maxi[l]) l++;
            ans[i] = l;
            used[l]++;
        }
        cout << ans[i] << " ";
    }
}