Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		_, M := io.NextInt(), io.NextInt()
		if M == 0 {
			break
		}
		r := io.NextInt()
		t, m, s := make([]int, r), make([]int, r), make([]int, r)
		for i := 0; i < r; i++ {
			t[i], _, m[i], s[i] = io.NextInt(), io.NextInt(), io.NextInt()-1, io.NextInt()
		}
		q := io.NextInt()
		for i := 0; i < q; i++ {
			ss, ee, mm := io.NextInt(), io.NextInt(), io.NextInt()-1
			x := make([]int, 1300)
			for j := 0; j < r; j++ {
				if m[j] == mm {
					if s[j] == 1 {
						x[t[j]]++
					} else {
						x[t[j]]--
					}
				}
			}
			for j := 1; j < 1300; j++ {
				x[j] = x[j] + x[j-1]
			}
			ans := 0
			for j := ss; j < ee; j++ {
				if x[j] > 0 {
					ans++
				}
			}
			io.Println(ans)
		}
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>
 
// #include <unordered_set>
// #include <unordered_map>
 
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
 
#define pb push_back
#define mp make_pair
 
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
 
typedef std::pair<int, int> P;
typedef long long ll;
typedef long double ld;
 
const int MOD = 1000000007;
const int INF = 1e9;
const ll LINF = INF * 1ll * INF;
const ld DINF = 1e200;
const double EPS = 1e-10;
const double PI  = acos(-1.0);
 
using namespace std;
 
#define int long long

const int MAX_V=1000;
// int memo[1000001]={0};
int dist[MAX_V][MAX_V];



signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cin?????????

    int a,b;
    int r,q;
    int t,n,m,s;
    int ts,tr,M;
    int ans;

    while(cin>>a>>b){
        // cin>>a>>b;
        if(a==0&&b==0)break;



        int table[10001][1261]={0};

        cin>>r;

        REP(i,r){

            // cout<<"t,n,m,s??\???"<<endl;

            cin>>t>>n>>m>>s;
            // t-=540;

            

            if(s==1){
                table[m][t]++;
            }else if(s==0){
                table[m][t]--;
            }

        }

        REP(i,10001){
            REP(j,1261){
                if(table[i][j]>=0)table[i][j+1]+=table[i][j];
            }
        }

        cin>>q;

        REP(i,q){
            ans=0;
            // cout<<"ts,tr,M??\???"<<endl;

            cin>>ts>>tr>>M;
            // ts-=540;
            // tr-=540;

            for(int l=ts;l<tr;l++){

                // cout<<table[M][l]<<" ";
                
                if(table[M][l]>=1)ans++;
            }
            // cout<<endl;
            // cout<<"??????"<<M<<"????????¨?????????"<<ans<<endl;

            cout<<ans<<endl;

        }
        // REP(i,30){
        //     cout<<i<<" ";
        // }cout<<endl;

        // REP(i,5){
        //     REP(j,30){
        //         cout<<table[i][j]<<" ";
        //     }cout<<endl;
        // }

    }






}

C++: #include<iostream>
using namespace std;
int main()
{
	int N,M;
	while(cin>>N>>M,N) 
	{
		int r;cin>>r;
		int t[r],m[r],s[r];
		int n;

		for(int i = 0; i < r; ++i)
		{
			cin>>t[i]>>n>>m[i]>>s[i];
		}

		int q; cin>>q;

		for(int i = 0; i < q; ++i)
		{
			int ts,te,sn;
			cin>>ts>>te>>sn;
			int ans=0,cnt=0,prev=0;
			for(int j = 0; j < r; ++j)
			{
				if(m[j]==sn)
				{
					if(s[j]==1)
					{
						cnt++;
						if(cnt==1)
						{
							if(t[j]<ts) prev=ts;
							else prev=t[j];
						}
					}
					else
					{
						cnt--;
						if(cnt==0)
						{
							if(t[j]<=te) ans+=t[j]-prev;
							else ans+=te-prev;
						}
					}
				}
			}
			if(cnt!=0) ans+=te-prev;
			cout<<ans<<endl;
		}
	}
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using TP = tuple<int,int,int,int>;

int main()
{
	int N, M, r, q, t, n, m, s, ts, te;
	while (cin >> N >> M, N || M) {
		vector<TP> use;
		cin >> r;
		while (r--) {
			cin >> t >> n >> m >> s;
			if (s) {
				use.push_back(TP(n, m, t, 0));
			}
			else {
				for (size_t j = use.size() - 1; j >= 0; j--) {
					if (get<0>(use[j]) == n && get<1>(use[j]) == m) {
						get<3>(use[j]) = t;
						break;
					}
				}
			}
		}
		cin >> q;
		while (q--) {
			cin >> ts >> te >> m;
			int res = 0;
			for (int k = ts; k < te; k++) {
				for (size_t j = 0; j < use.size(); j++) {
					if (get<1>(use[j]) == m && get<2>(use[j]) <= k && get<3>(use[j]) > k) {
						res++;
						break;
					}
				}
			}
			cout << res << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
#include <list>
#include<stack>
#include<queue>
#include <vector>
#include <set>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<string>
#include <functional>
#include<fstream>

#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define REP(i,n) FOR((i),0,(n))
#define LL long long
#define CLR(a) memset((a),0,sizeof(a))
#define SZ(x) (int((x).size()))
#define WAITING(str) int str;std::cin>>str;
#define DEBUGING(str) cout<<str<<endl
using namespace std;

const LL MOD = 1000000007;// 10^9+7
const int INF = (1 << 30);


//変数
struct Database {
	int N, M, r, q;
	vector<vector<int>> use;

	Database() 
	{
		cin >> N >> M;
		if (N == 0)return;
		use.resize(M+1, vector<int>(60 * 24));

		cin >> r;
		REP(i, r) {
			int t, n, m, s;
			cin >> t >> n >> m >> s;
			use[m][t] += (s == 1 ? 1 : -1);
		}
		REP(i, M+1)REP(t, 60 * 24-1)
			use[i][t + 1] += use[i][t];
	}
	
	void query()
	{

		int ts, te, m;
		cin >> ts >> te >> m;
		
		int res = 0;
		FOR(t, ts, te) {
			res += (use[m][t] > 0 ? 1 : 0);
		}
		//cerr << "==========";
		cout << res << endl;
	}
};


//メイン関数
int main()
{
	while (true) {
		Database base;
		if (base.N == 0)break;

		int q;
		cin >> q;
		REP(i, q)base.query();
	}

	return 0;
}