from bisect import bisect_right N,Q = map(int,input().split()) A = [[0,0]]+[list(map(int,input().split())) for _ in range(N)] A = sorted(A,key=lambda x:x[0]) B = [0]*(N+1) C = [0]*(N+1) for i in range(1,N+1): B[i] = B[i-1]+A[i][1] C[i] = C[i-1]+A[i][0]*A[i][1] X = list(map(int,input().split())) for x in X: j = bisect_right(A,[x,10**5]) ans = x*B[N]+C[N]-2*x*(B[N]-B[j-1])-2*C[j-1] print(ans)