class Bit:
    def __init__(self, n):
        self.size = n
        self.n0 = 1 << (n.bit_length() - 1)
        self.tree = [0] * (n + 1)
    
    def range_sum(self, l, r):
        return self.sum(r - 1) - self.sum(l - 1)
        
    def sum(self, i):
        i += 1
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s
        
    def get(self, i):
        return self.sum(i) - self.sum(i - 1)
 
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i
         
    def lower_bound(self, x):
        pos = 0
        plus = self.n0
        while plus > 0:
            if pos + plus <= self.size and self.tree[pos + plus] < x:
                x -= self.tree[pos + plus]
                pos += plus
            plus //= 2
        return pos

n, Q = map(int, input().split())
xw = [list(map(int, input().split())) for _ in range(n)]
X = list(map(int, input().split()))
se = set()
for x, _ in xw:
    se.add(x)
for x in X:
    se.add(x)
lst = sorted(se)
dic = {l:i for i, l in enumerate(lst)}
le = len(lst)
cnt = Bit(le)
tot = Bit(le)
for x, w in xw:
    cnt.add(dic[x], w)
    tot.add(dic[x], x * w)
for x in X:
    ans = x * cnt.sum(dic[x]) - tot.sum(dic[x])
    ans += tot.range_sum(dic[x], le) - x * cnt.range_sum(dic[x], le)
    print(ans)