#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

const int N = 55;
const int M = 5e6 + 5;
const double eps = 1e-8;

int dcmp(double x) {
  return x < -eps ? -1 : x > eps;
}

LL v[N], c[N];
LL f[M];

void solve() {
  int n, q;
  cin >> n >> q;

  double mx = 0;
  int id = 0;
  for (int i = 1; i <= n; ++i) {
    cin >> v[i] >> c[i];
    double w = double(c[i]) / v[i];
    if (dcmp(w - mx) > 0) mx = w, id = i;
  }

  memset(f, -1, sizeof f);
  f[0] = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = v[i]; j <= M - 5; ++j) {
      if (f[j - v[i]] == -1) continue;
      f[j] = max(f[j - v[i]] + c[i], f[j]);
    }
  }

  for (int i = 1; i <= q; ++i) {
    LL V;
    cin >> V;
    LL ti = V / v[id];
    LL ans = -1;
    int times = 0;
    while (ti >= 0 && V - v[id] * ti <= M - 5) {
      if (f[V - v[id] * ti] != -1) {
        ans = max(ans, c[id] * ti + f[V - v[id] * ti]);
      }
      --ti;
      // if (++times > 500) break;
    }
    cout << ans << "\n";
  }
}

int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int T = 1;
  // cin >> T;
  while (T--) {
    solve();
  } 
  return 0;
}