import sys
input = sys.stdin.readline
from itertools import accumulate
import bisect
n,q = map(int,input().split())
xw = [list(map(int,input().split())) for i in range(n)]
xw.append([0,0])
xw.append([10**9,0])
xw.sort()
acc = list(accumulate(list(zip(*xw))[1]))
ls = []
x = xw[0][0]
cost = 0
n += 2
for i in range(1,n):
  x1,w1 = xw[i]
  cost += (x1-x)*w1
ls.append((x,cost))
for i in range(1,n):
  pos,w = xw[i]
  x,cost = ls[-1]
  cost += acc[i-1]*(pos-x)
  cost -= (acc[n-1]-acc[i-1])*(pos-x)
  ls.append((pos,cost))
xls = list(zip(*xw))[0]
query = list(map(int,input().split()))
ans = []
for i in query:
  x = bisect.bisect_left(xls,i)
  x1,c1 = ls[x-1]
  x2,c2 = ls[x]
  dc = c2-c1
  print(c1+dc*(i-x1)//(x2-x1))