import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    n,q=MI()
    xw=LLI(n)
    yy=LI()
    xw.sort()
    xx=[x for x,w in xw]
    fss=[0]*n
    fdd=[0]*(n+1)
    s=d=0
    px=xw[0][0]
    for i,(x,w) in enumerate(xw):
        s+=d*(x-px)
        fss[i]=s
        fdd[i]=d
        d+=w
        px=x
    fdd[n]=d

    rss=[0]*n
    rdd=[0]*(n+1)
    s=d=0
    px=xw[n-1][0]
    for i,(x,w) in enumerate(xw[::-1]):
        i=n-1-i
        s+=d*(px-x)
        d+=w
        rss[i]=s
        rdd[i]=d
        px=x

    for y in yy:
        i=bisect_right(xx,y)
        if i==0:ans=rss[i]+(xx[i]-y)*rdd[i]
        elif i==n:ans=fss[i-1]+(y-xx[i-1])*fdd[i]
        else:ans=fss[i-1]+(y-xx[i-1])*fdd[i]+rss[i]+(xx[i]-y)*rdd[i]
        print(ans)


main()