INF = 10 ** 7
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from bisect import bisect_left

def main():
    n,q = map(int,input().split())
    work = [tuple(map(int,input().split())) for _ in range(n)]
    
    X = list(map(int,input().split()))
    work.sort(key = lambda x:x[0])
    R = [work[i][0] for i in range(n)]
    W = [work[i][1] for i in range(n)]

    cumlw = [0] * (n + 1)
    cumrw = [0] * (n + 1)
    cumlwx = [0] * (n + 1)
    cumrwx = [0] * (n + 1)

    for i in range(n):
        cumlw[i + 1] = cumlw[i] + W[i]
        cumlwx[i + 1] = cumlwx[i] + W[i] * R[i]
    
    for i in range(n - 1,-1,-1):
        cumrw[i] = cumrw[i + 1] + W[i]
        cumrwx[i] = cumrwx[i + 1] + W[i] * R[i]
    
    ans = []
    for i in range(q):
        idx = bisect_left(R,X[i])
        ret = X[i] * (cumlw[idx] - cumrw[idx]) - cumlwx[idx] + cumrwx[idx]
        ans.append(ret)
    
    print(*ans,sep = '\n')

if __name__ == '__main__':
    main()