import sys
input=sys.stdin.readline
from bisect import bisect
n,q=map(int,input().split())
l=[tuple(map(int,input().split())) for i in range(n)]
l.sort()
aw=[0]
axw=[0]
for x,w in l:
    aw.append(aw[-1]+w)
    axw.append(axw[-1]+x*w)
x=list(map(int,input().split()))
for i in x:
    t=bisect(l,(i,0))
    print(i*aw[t]-axw[t]+axw[n]-axw[t]-i*(aw[n]-aw[t]))