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

using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, k;
	cin >> n >> k;
	vector<int> m(k + 1);
	for (int i = 1; i <= k; ++i) {
		cin >> m[i];
	}
	vector<int> s(n + 1), t(n + 1);
	for (int i = 1; i <= n; ++i) {
		cin >> s[i];
	}
	for (int i = 1; i <= n; ++i) {
		cin >> t[i];
	}

	vector<vector<int>> w(k + 1);
	for (int i = 1; i <= n; ++i) {
		w[s[i]].push_back(i);
	}

	vector<int> a(n + 1);
	long long sum = 0;
	vector<int> u;

	for (int r = 1; r <= k; ++r) {
		auto& v = w[r];

		sort(v.begin(), v.end(), [&](int a, int b) {
			return t[a] < t[b];
			});

		if ((int)v.size() > m[r]) {
			int e = v.size() - m[r];
			for (int i = 0; i <= e; ++i) {
				u.push_back(v[i]);
			}
			for (int i = e; i <= (int)v.size(); ++i) {
				a[v[i]] = r;
			}
		}
		else{
			for (int x : v) {
				a[x] = r;
			}
		}
	}

	for (int r = 1; r <= k; ++r) {
		int c = 0;
		for (int i = 1; i <= n; ++i) {
			if (a[i] == r) {
				++c;
			}
		}

		if (c == 0) {
			int g = u.back();
			u.pop_back();
			a[g] = r;
			sum += t[g];
		}
	}

	for (int g : u) {
		for (int r = 1; r <= k; ++r) {
			int c = 0;
			for (int i = 1; i <= n; ++i) {
				if (a[i] == r) {
					++c;
				}
			}

			if (c < m[r]) {
				a[g] = r;
				sum += t[g];
				
				break;
			}
		}
	}

	cout << sum << "\n";
	for (int i = 1; i <= n; ++i) {
		cout << a[i] << " ";
	}
}