import java.util.Arrays;

public class Main {

  private static void solve() {
    int n = ni();
    int q = ni();

    long[][] p = new long[n][2];
    for (int i = 0; i < n; i++) {
      p[i][0] = nl(); // x
      p[i][1] = nl(); // w
    }
    Arrays.sort(p, (o1, o2) -> Long.signum(o1[0] - o2[0]));

    // p [0:x, w, total w l, total sum l, total w r, total sum r]
    long[][] ql = new long[n][2];
    long[][] qr = new long[n][2];

    ql[0][1] = p[0][1];
    for (int i = 1; i < n; i++) {
      ql[i][0] = ql[i - 1][0] + ql[i - 1][1] * (p[i][0] - p[i - 1][0]);
      ql[i][1] = ql[i - 1][1] + p[i][1];
    }

    qr[n - 1][1] = p[n - 1][1];
    for (int i = n - 2; i >= 0; i--) {
      qr[i][0] = qr[i + 1][0] + qr[i + 1][1] * (p[i + 1][0] - p[i][0]);
      qr[i][1] = qr[i + 1][1] + p[i][1];
    }

    for (int i = 0; i < q; i++) {
      long x = nl();
      int idx = lowerBound(p, x);
      long ret = 0;
      if (idx > 0) {
        ret += (x - p[idx - 1][0]) * ql[idx - 1][1] + ql[idx - 1][0];
      }
      if (idx <= n - 1) {
        ret += (p[idx][0] - x) * qr[idx][1] + qr[idx][0];
      }
      out.println(ret);
    }
  }

  public static int lowerBound(long[][] a, long v) {
    int low = -1, high = a.length;
    while (high - low > 1) {
      int h = high + low >>> 1;
      if (a[h][0] >= v) {
        high = h;
      } else {
        low = h;
      }
    }
    return high;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}