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

using namespace std;

vector<int> maxm;
vector<int> Tot;
vector<int> wants;
vector<int> losses;
vector<bool> req;

int main()
{
	long long loss = 0, am = 0;
	int n, k;
	cin >> n >> k;
	for (int i = 0; i < k; i++)
	{
		int l;
		cin >> l;
		maxm.push_back(l);
		Tot.push_back(0);
	}
	for (int i = 0; i < n; i++)
	{
		int a;
		cin >> a;
		a--;
		req.push_back(false);
		wants.push_back(a);
	}
	for (int i = 0; i < n; i++)
	{
		int b;
		cin >> b;
		losses.push_back(b);
	}
	for (int i = 0; i < n; i++)
	{
		int index = wants[i]; // 0 - (k - 1)
		if (Tot[index] == maxm[index])
		{
			int min = 10001;
			int s = -1;
			for (int j = 0; j <= i; j++)
			{
				int jndex = wants[j];
				if (jndex == index && !req[j])
				{
					if (losses[j] < min)
					{
						s = j;
						min = losses[j];
					}
				}
			}
			req[s] = true;
			am++;
			loss += min;
		}
		else
		{
			Tot[index]++;
		}
	}
	int zcount = 0;
	for (int l = 0; l < k; l++)
	{
		if (Tot[l] == 0)
		{
			zcount++;
		}
	}
	for (int i = 0; i < zcount - am; i++)
	{
		int min = 10001;
		int s = -1;
		for (int j = 0; j < n; j++)
		{
			if (!req[j])
			{
				if (losses[j] < min)
				{
					s = j;
					min = losses[j];
				}
			}
		}
		req[s] = true;
		loss += min;
	}
	cout << loss << endl;
	for (int i = 0; i < n; i++)
	{
		if (!req[i])
		{
			cout << wants[i] + 1 << " ";
		}
		else
		{
			bool z = false;
			for (int l = 0; l < k; l++)
			{
				if (Tot[l] == 0)
				{
					cout << l + 1 << " ";
					Tot[l]++;
					z = true;
					break;
				}
			}
			if (!z)
			{
				for (int l = 0; l < k; l++)
				{
					if (Tot[l] < maxm[l])
					{
						cout << l + 1 << " ";
						Tot[l]++;
						break;
					}
				}
			}
		}
	}
}