#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int k, n;
    cin >> k >> n;
    vector<long long>db(n + 1);
    for (int i = 1; i <= n; i++)
    {
        int x; cin >> x;
        db[i] = x;
    }
    vector<vector<long long>>gyerek(k, vector<long long>(3));
    for (int i = 0; i < k; i++)
    {
        int x; cin >> x;
        gyerek[i][0] = i + 1;
        gyerek[i][1] = x;
    }
    // sorsz.,szerep,siras
    for (int i = 0; i < k; i++)
    {
        int x; cin >> x;
        gyerek[i][2] = x;
    }
    sort(gyerek.begin(), gyerek.end(), [](auto a, auto b) {
        return a[2] > b[2];
        });
    int sum = 0;
    vector<long long> res(k + 1, -1);
    vector<long long> maradt;
    for (int i = 0; i < k; i++)
    {
        if (db[gyerek[i][1]] > 0)
        {
            res[gyerek[i][0]] = gyerek[i][1];
            db[gyerek[i][1]]--;
        }
        else
        {
            sum += gyerek[i][2];
        }
    }
    for (int i =1; i <= n; i++)
    {
        while (db[i] > 0)
        {
            maradt.push_back(i);
            db[i]--;
        }
    }
    cout << sum << endl;
    int x = maradt.size() - 1;
    for (int i = 1; i <= k; i++)
    {
        if (res[i] == -1)
        {
            res[i] = maradt[x];
            x--;
        }
    }
    for (int i = 1; i <= k; i++)
        cout << res[i] << " ";
    return 0;
}