/*************************************
* author: marvinthang *
* created: 08.08.2023 18:39:30 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b) { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b) { if (a < b) { a = b; return true; } return false; }
// end of template
const int MAX = 1e5 + 5;
const int MAXD = 1023;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
int N, Q;
pair <int, int> points[MAX];
void init(void) {
cin >> N >> Q;
REP(i, N) cin >> points[i];
}
namespace SUBTASK_2 {
int dist[MAXD * 4][MAXD * 4], cnt[MAXD];
void solve(void) {
queue <pair <int, int>> q;
REP(i, N) {
auto [x, y] = points[i];
x += MAXD + MAXD;
y += MAXD + MAXD;
dist[x][y] = 1;
q.emplace(x, y);
}
while (!q.empty()) {
auto [x, y] = q.front(); q.pop();
++cnt[dist[x][y] - 1];
if (dist[x][y] >= 1001) continue;
REP(d, 4) {
int u = x + dx[d];
int v = y + dy[d];
if (!dist[u][v]) {
dist[u][v] = dist[x][y] + 1;
q.emplace(u, v);
}
}
}
while (Q--) {
int t; cin >> t;
cout << cnt[t] << '\n';
}
}
}
void process(void) {
int max_d = 0;
REP(i, N) maximize(max_d, max(abs(points[i].fi), abs(points[i].se)));
if (max_d < MAXD) {
SUBTASK_2 :: solve();
return;
}
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("cell");
init();
process();
cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
