#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
#define int long long
#define all(x) (x).begin(), (x).end()
const int inf = 1e18;
void run(int tc) {
int n, q; cin >> n >> q;
vector<array<int, 5>> a(n + 1), b;
vector<array<int, 4>> que(q + 1);
vector<vector<array<int, 2>>> ev;
vector<int> ans(n + 1), comp;
set<int> color[n + 1];
set<int> active;
for (int i = 1; i <= n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3];
a[i][4] = i;
comp.push_back(a[i][0]);
comp.push_back(a[i][1]);
comp.push_back(a[i][2]);
comp.push_back(a[i][3]);
}
b = a;
sort(b.begin() + 1, b.end());
for (int i = 1; i <= q; i++) {
cin >> que[i][0] >> que[i][1] >> que[i][2];
comp.push_back(que[i][0]);
comp.push_back(que[i][1]);
que[i][3] = i;
}
sort(all(comp));
auto compress = [&](int x) -> int {
return lower_bound(all(comp), x) - comp.begin() + 1;
};
ev.resize((int)comp.size() + 1);
for (int i = 1; i <= q; i++) {
que[i][0] = compress(que[i][0]);
que[i][1] = compress(que[i][1]);
ev[que[i][0]].push_back({0, i});
}
for (int i = 1; i <= n; i++) {
a[i][0] = compress(a[i][0]);
a[i][1] = compress(a[i][1]);
a[i][2] = compress(a[i][2]);
a[i][3] = compress(a[i][3]);
ev[a[i][0]].push_back({1, i});
ev[a[i][3]].push_back({2, i});
}
auto in = [&](int i, int j) -> bool {
auto [x1, y1, x2, y2, _] = a[j];
auto [x, y, c, __] = que[i];
return (x1 <= x && x <= x2 && y1 <= y && y <= y2);
};
for (int i = 1; i <= (int)comp.size(); i++) {
for (auto [ty, j] : ev[i]) {
if (ty != 1) continue;
active.insert(j);
}
for (auto [ty, j] : ev[i]) {
if (ty != 0) continue;
for (auto idx : active) {
if (in(j, idx)) {
color[idx].insert(que[j][2]);
}
}
}
for (auto [ty, j] : ev[i]) {
if (ty != 2) continue;
active.erase(active.find(j));
}
}
for (int i = 1; i <= n; i++) {
cout << (int)color[i].size() << '\n';
debug(color[i]);
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1; // cin >> t;
for (int tc = 1; tc <= t; tc++) run(tc);
}
