import bisect
n,q = map(int,input().split())
xw = [[int(i) for i in input().split()] for j in range(n)]
x = [int(i) for i in input().split()]

x.sort()
xw.sort()
pos = []
wei = []
for i in range(n):
    pos.append(xw[i][0])
    wei.append(xw[i][1])

rw = [0]*(n+1)
for i in range(n):
    rw[i+1] = rw[i]+wei[i]

ans = 0
for i in range(n):
    ans += abs(x[0]-pos[i])*wei[i]

print(ans)

for i in range(q-1):
    bidx = bisect.bisect_right(pos,x[i])
    aidx = bisect.bisect_left(pos,x[i+1])
    #print(bidx,aidx,rw)
    ans += (x[i+1]-x[i])*(rw[bidx]-rw[0])
    ans -= (x[i+1]-x[i])*(rw[n]-rw[aidx])
    for j in range(bidx,aidx):
        ans -= abs(x[i]-pos[j])*wei[j]
        ans += abs(x[i+1]-pos[j])*wei[j]
    print(ans)