#include <bits/stdc++.h>
using namespace std;
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
} in( "grendizer.in" );
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
} out( "grendizer.out" );
const int DIM = 1e5 + 5;
pair<int, int> pts1[DIM], pts2[DIM];
int main( void ) {
ios::sync_with_stdio( false );
int n, m;
in >> n >> m;
for( int i = 1; i <= n; i ++ ) {
int x, y;
in >> x >> y;
pts1[i] = make_pair( x - y, y );
pts2[i] = make_pair( x + y, y );
}
sort( pts1 + 1, pts1 + n + 1 );
sort( pts2 + 1, pts2 + n + 1 );
for( int i = 1; i <= m; i ++ ) {
int x, y, z, ans = 0;
in >> x >> y >> z;
ans += lower_bound( pts1 + 1, pts1 + n + 1, make_pair( x - y - z, y + z ) ) -
lower_bound( pts1 + 1, pts1 + n + 1, make_pair( x - y - z, y ) );
ans += upper_bound( pts1 + 1, pts1 + n + 1, make_pair( x - y + z, y ) ) -
upper_bound( pts1 + 1, pts1 + n + 1, make_pair( x - y + z, y - z ) );
ans += lower_bound( pts2 + 1, pts2 + n + 1, make_pair( x + y - z, y ) ) -
lower_bound( pts2 + 1, pts2 + n + 1, make_pair( x + y - z, y - z ) );
ans += upper_bound( pts2 + 1, pts2 + n + 1, make_pair( x + y + z, y + z ) ) -
upper_bound( pts2 + 1, pts2 + n + 1, make_pair( x + y + z, y ) );
out << ans << "\n";
}
return 0;
}