# O(NlogN?) moho

from sys import stdin, stdout
input=stdin.readline

from math import gcd

def solv():
    N,K = [int(x) for x in input().split()]
    maxi = [int(x) for x in input().split()]
    szerep = [int(x)-1 for x in input().split()]
    sir = [(int(x),index) for index,x in enumerate(input().split())]
    sir.sort(reverse=True)
    #print(sir)
    szerep_set=set(szerep)
    not_choosen=set()
    for i in range(1,K):
        if i not in szerep_set:
            not_choosen.add(i)
    #print(not_choosen)
    res=0
    lista=[0]*N
    done=set()
    sirnifog=[]
    for i in range(len(sir)):
        #print(sir[i],lista,len(done),len(not_choosen),len(sirnifog))
        s,index=sir[i]
        #if len(done)+len(not_choosen)+len(sirnifog)==N and len(not_choosen)>len(sirnifog):
        if K-len(done)-len(sirnifog)==N-i:
            x=not_choosen.pop()
            lista[index]=x
            done.add(index)
            res+=s
        elif maxi[szerep[index]]>0:
            maxi[szerep[index]]-=1
            lista[index]=szerep[index]
            done.add(index)
        else:
            sirnifog.append(index)
            res+=s
    index=0
    while sirnifog:
        x=sirnifog.pop()
        if not_choosen:
            y=not_choosen.pop()
            maxi[y]-=1
            lista[x]=y
        else:
            while maxi[index]==0:
                index+=1
            maxi[index]-=1
            lista[x]=index
    print(res)
    print(*[x+1 for x in lista])

    return

solv()