#include <bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
using pair = std::array<int, 2>;
using pairll = std::array<ll, 2>;
using tri = std::array<int, 3>;
using trill = std::array<ll, 3>;

constexpr long long MOD = 998244353;

int main() { 
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int N, Q;
    std::cin >> N >> Q;

    std::vector<tri> points;

    for (int i = 0; i < N; i++) {
    	int a, b;
    	std::cin >> a >> b;
    	tri score = {a, b, 1};
    	points.push_back(score);
    }


    std::sort(points.begin(), points.end(), [](tri a, tri b) {
    	if (a[0] != b[0]) {
    		return a[0] > b[0];
    	} else {
    		return a[1] > b[1];
    	}
    });

    // unique
    for (int i = points.size() - 1; i >= 0; i--) {
    	if (points[i][0] == points[i+1][0] && points[i][1] == points[i+1][1]) {
    		points[i][2] += points[i+1][2];
    	}
    }
    points.erase(std::unique(points.begin(), points.end(), [](tri a, tri b){return a[0] == b[0] && a[1] == b[1];}), points.end());


    for (auto point : points) {
    	// std::cout << point[0] << ' ' << point[1] << ' ' << point[2] << '\n';
    }

    for (int i = 1; i < points.size(); i++) {
    	points[i][2] += points[i-1][2];
    }

    // std::cout << points[points.size() - 1][2] << '\n';
    while (Q--) {
    	int x, y ,z;
    	std::cin >> x >> y >> z;

        tri search  = {x, y, 0};
        std::vector<tri>::iterator target = std::upper_bound(points.begin(), points.end(), search, [](tri val, tri el) {return val[0] >= el[0];});
    	if (target == points.end()) {
            std::cout << "0\n";
            continue;
        }
        std::cout << (*target)[2] << '\n';

    }
}