import bisect

n, q = map(int, input().split())
goods = []
for _ in range(n):
    x, w = map(int, input().split())
    goods.append((x, w))

# Sort the goods by their x coordinates
goods.sort()
sorted_x = [x for x, w in goods]

# Precompute prefix sums for weight and weight*x
prefix_w = [0] * (n + 1)
prefix_wx = [0] * (n + 1)
for i in range(n):
    prefix_w[i + 1] = prefix_w[i] + goods[i][1]
    prefix_wx[i + 1] = prefix_wx[i] + goods[i][0] * goods[i][1]

total_w = prefix_w[n]
total_wx = prefix_wx[n]

# Process each query
queries = list(map(int, input().split()))
for X in queries:
    k = bisect.bisect_right(sorted_x, X)
    sum_left_w = prefix_w[k]
    sum_left_wx = prefix_wx[k]
    sum_right_w = total_w - sum_left_w
    sum_right_wx = total_wx - sum_left_wx

    cost = X * (sum_left_w - sum_right_w) + (sum_right_wx - sum_left_wx)
    print(cost)