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 <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
#define let auto const

int main() {
  i64 N, M;
  while(cin >> N >> M, N && M) {
    vector<vector<i64>> sum(M, vector<i64>(1260 + 1, 0));
    i64 R;
    cin >> R;
    rep(r, 0, R) {
      i64 t, n, m, s;
      cin >> t >> n >> m >> s;
      m--;
      if(s == 1) {
        sum[m][t]++;
      }
      else {
        sum[m][t]--;
      }
    }
    rep(i,0,M) rep(j,1,1260 + 1) {
      sum[i][j] += sum[i][j - 1];
    }

    rep(i,0,M) rep(j,1,1260 + 1) {
      sum[i][j] = !!sum[i][j];
    }

    rep(i,0,M) rep(j,1,1260 + 1) {
      sum[i][j] += sum[i][j - 1];
    }


    i64 Q;
    cin >> Q;
    rep(q, 0, Q) {
      i64 s, e, m;
      cin >> s >> e >> m;
      m--;
      cout << sum[m][e - 1] - sum[m][s - 1] << endl;
    }
  }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cstring>
using namespace std;

int dp[10001][722];

int main() {
    int N, M;
    while (cin >> N >> M, N || M) {
        memset(dp, 0, sizeof dp);
        int r;
        cin >> r;
        for (int i=0; i<r; ++i) {
            int t, n, m, s;
            cin >> t >> n >> m >> s;
            if (s == 1) {
                dp[m][t-540] += 1;
            } else {
                dp[m][t-540] -= 1;
            }
        }
        for (int i=1; i<=M; ++i) {
            for (int j=1; j<722; ++j) {
                dp[i][j] = dp[i][j-1] + dp[i][j];
            }
        }
        int q;
        cin >> q;
        for (int i=0; i<q; ++i) {
            int ts, te, m;
            cin >> ts >> te >> m;
            int cnt = 0;
            for (int j=ts; j<te; ++j) {
                cnt += (0 < dp[m][j-540]);
            }
            cout << cnt << endl;
        }
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen

#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
bool tt[1300];

int main()
{
//	cut here before submit 
//	freopen ("testcase.ALLR", "r", stdin );
	int N, M;
	while (scanf ("%d %d", &N, &M ), N, M ){
		vector<vector<vector<int> > > login  (M, vector<vector<int> > (N ) );
		vector<vector<vector<int> > > logout (M, vector<vector<int> > (N ) );

		int r;
		scanf ("%d", &r );
		rep (i, r ){
			int t, n, m, s;
			scanf ("%d %d %d %d", &t, &n, &m, &s );
			n--;m--;
			if (s == 1 ){
				login[m][n].push_back (t );
			}else{
				logout[m][n].push_back (t );
			} // end if
		} // end rep

		int q;
		scanf ("%d", &q );
		vector<int> ans (q, 0 );

		rep (i, q ){
			int ts, te, m;
			scanf ("%d %d %d", &ts, &te, &m );
			m--;
			memset (tt, false, sizeof (tt ) );
			rep (j, N ){
				if (!login[m][j].empty() ){
					rep (k, login[m][j].size() ){
						for (int l = login[m][j][k]; l < logout[m][j][k]; l++ ){
							tt[l] = true;
						} // end for
					} // end rep
				} // end if
			} // end rep
			int res = 0;
			for (int t = ts; t < te; t++ ){
				if (tt[t] ) res++;
			} // end if
			ans[i] = res;
		} // end rep
		rep (i, q ){
			printf ("%d\n", ans[i] );
		} // end rep
			
	} // end loop
		
	return 0;
}