#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair <int,int> ii; typedef pair <ii,int> iii; #define endl '\n' #define pb push_back #define fi first #define se second #define MASK(i) (1ll << (i)) #define BIT(x, i) (((x) >> (i)) & 1) int n,q; int a[300005]; int b[300005]; int c[300005]; int d[300005]; int x[300005]; int y[300005]; int k[300005]; namespace sub1{ bool check(){ return n <= 5000 && q <= 5000; } void solve(){ for (long i=1; i<=n; i++){ set <int> s; for (long j=1; j<=q; j++){ if (a[i] <= x[j] && x[j] <= c[i] && b[i] <= y[j] && y[j] <= d[i]) s.insert(k[j]); } cout << s.size() << endl; } } } signed main() { ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); cin >> n >> q; for (long i=1; i<=n; i++) cin >> a[i] >> b[i] >> c[i] >> d[i]; for (long i=1; i<=q; i++) cin >> x[i] >> y[i] >> k[i]; sub1::solve(); return 0; }