import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const Q = readInt();
      auto X = new long[N];
      auto W = new long[N];
      foreach (i; 0 .. N) {
        X[i] = readLong();
        W[i] = readLong();
      }
      auto Y = new long[Q];
      foreach (q; 0 .. Q) {
        Y[q] = readLong();
      }
      
      auto xs = X.dup.sort.uniq.array;
      const xsLen = cast(int)(xs.length);
      auto s0 = new long[xsLen + 1];
      auto s1 = new long[xsLen + 1];
      foreach (i; 0 .. N) {
        const pos = xs.lowerBound(X[i]);
        s0[pos + 1] += W[i];
        s1[pos + 1] += X[i] * W[i];
      }
      foreach (j; 0 .. xsLen) {
        s0[j + 1] += s0[j];
        s1[j + 1] += s1[j];
      }
      
      foreach (q; 0 .. Q) {
        const pos = xs.lowerBound(Y[q]);
        long ans;
        ans += Y[q] * s0[pos] - s1[pos];
        ans += (s1[xsLen] - s1[pos]) - Y[q] * (s0[xsLen] - s0[pos]);
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}