# coding: utf-8
# Your code here!

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read

n,Q = [int(i) for i in readline().split()]
xw = [[int(i) for i in readline().split()] for _ in range(n)]
qs = [int(i) for i in readline().split()]

xw.sort(key = lambda x:x[0])

c = -sum(xwi[1] for xwi in xw)
xs = [xwi[0] for xwi in xw] + [10**10]
x0 = xw[0][0]
v = sum((x-x0)*w for x,w in xw)

coeff = [c]
val = []
for i,(x,w) in enumerate(xw):
    c += 2*w
    coeff.append(c)
    val.append(v)    
    v += c*(xs[i+1]-xs[i])

xs.pop()
v = val[-1]
from bisect import bisect_left
for q in qs:
    idx = bisect_left(xs,q)
    if idx < n:
        print(val[idx]-coeff[idx]*(xs[idx]-q))        
    else:
        print(v+c*(q-xs[-1]))