#include <bits/stdc++.h>
using namespace std;

// region template
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (ll)(x).size()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;

ll gcd(ll a, ll b) { return __gcd(a, b); }

ll euclid(ll a, ll b, ll &x, ll &y) {
    if (b) {
        ll d = euclid(b, a % b, y, x);
        return y -= a / b * x, d;
    }
    return x = 1, y = 0, a;
}

typedef unsigned long long ull;
typedef long double ld;
ull mod_mul(ull a, ull b, ull M) {
    ll ret = a * b - M * ull(ld(a) * ld(b) / ld(M));
    return ret + M * (ret < 0) - M * (ret >= (ll)M);
}
ull mod_pow(ull b, ull e, ull mod) {
    ull ans = 1;
    for (; e; b = mod_mul(b, b, mod), e /= 2)
        if (e & 1)
            ans = mod_mul(ans, b, mod);
    return ans;
}

const ll mod = 1000000007;
struct Mod {
    ll x;
    Mod(ll xx) : x(xx) {}
    Mod operator+(Mod b) { return Mod((x + b.x) % mod); }
    Mod operator-(Mod b) { return Mod((x - b.x) % mod); }
    Mod operator*(Mod b) { return Mod((x * b.x) % mod); }
    Mod operator/(Mod b) { return *this * invert(b); }
    Mod invert(Mod a) {
        ll x, y, g = euclid(a.x, mod, x, y);
        assert(g == 1);
        return Mod((x + mod) % mod);
    }
    Mod operator^(ll e) {
        if (!e)
            return Mod(1);
        Mod r = *this ^ (e / 2);
        r = r * r;
        return e & 1 ? *this * r : r;
    }
};
// endregion

int isprime(int n) {
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0 && (i % 7 == 1 || i % 7 == 6) && (n / i % 7 == 1 || n / i % 7 == 6)) {
            return false;
        }
    }
    return true;
}

int toint(string s) {
    string b;
    copy_if(all(s), back_inserter(b), [](char c) { return c != ':'; });
    return stoi(b);
}

int main() {
    cin.sync_with_stdio(0);
    cin.tie(0);
    cin.exceptions(cin.failbit);

    for (;;) {
        int N, M, r, q;
        cin >> N >> M;

        if (!N) break;

        cin >> r;
        
        map<int, map<int, map<int, int>>> rec;

        rep(i, 0, r) {
            int t, n, m, s; cin >> t >> n >> m >> s;
            rec[m][n][t] = s;
        }

        vector<vi> u(M + 1, vi(1261, 0)), ups(M + 1, vi(1261, 0));
        for (auto p1 : rec) {
            int stud = p1.first;
            for (auto p2 : p1.second) {
                for (auto it = p2.second.begin(); it != p2.second.end(); ++it) if (it->second) {
                    // cout << "Stud " << stud << "; PC " << p2.first << "; Time " << it->first << "; Event " << it->second << endl;
                    int lo = it->first, hi = next(it) == p2.second.end() ? 1260 : next(it)->first;
                    // cout << "OR " << lo << ", " << hi << ", " << it->second << endl;
                    for (int i = lo; i < hi; i++) u[stud][i] |= it->second;
                }
            }
        }

        rep(i, 1, M + 1) partial_sum(all(u[i]), ups[i].begin());

        cin >> q;

        rep(i, 0, q) {
            int s, t, e; cin >> s >> t >> e;
            // cout << "Query User " << e << "; " << s  << " ~ " << t << endl;
            cout << (ups[e][t - 1] - ups[e][s - 1]) << endl;
        }
        // cout << "---" << endl;
    }
}



Measured memory_bytes: 99068