#include <cstdio>
#include <cassert>

const int MAX_N = 100001;

int X[MAX_N], Y[MAX_N];

inline int my_abs(int x) {
    return x > 0 ? x : -x;
}

int main() {
    int N, M;
    freopen("grendizer.in", "rt", stdin);
    freopen("grendizer.out", "wt", stdout);
    scanf("%d %d", &N, &M);
    assert(0 < N && N < MAX_N);
    assert(0 < M && M < MAX_N);

    int x, y, r;
    for (int i = 0; i < N; ++i) {
        scanf("%d %d", X + i, Y + i);
    }
    for (int i = 0; i < M; ++i) {
        scanf("%d %d %d", &x, &y, &r);
        int sol = 0;
        for (int j = 0; j < N; ++j) {
            if (my_abs(X[j] - x) + my_abs(Y[j] - y) == r) {
                ++sol;
            }
        }
        printf("%d\n", sol);
    }
    return 0;
}