import heapq
m,n=input().split()
a=list(map(int,input().split()))
b=list(map(int,input().split()))
heapq.heapify(a)
maxscore=max(a)
for i in b:
    minscore=heapq.heappop(a)
    minscore+=i
    heapq.heappush(a,minscore)
    maxscore=max(maxscore,minscore)
    print(maxscore)