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 <cstdio>
#include <algorithm>
#include <vector>
#include <functional>
#include <queue>
#include <string>
#include <cstring>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
using namespace std;

typedef long long ll;

#define INF 10e17
#define rep(i,n) for(int i=0; i<n; i++)
#define rep_r(i,n,m) for(int i=m; i<n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<int>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) for (auto itr : x) { debug(itr); }

template <class T> inline void chmax(T &ans, T t) { if (t > ans) ans = t;}
template <class T> inline void chmin(T &ans, T t) { if (t < ans) ans = t;}

using pi = pair<int,int>;

int main() {
  int N, M;
  while (cin >> N >> M and N != 0 and M != 0) {
    vector<pi> pc[N+1];
    int R, Q;
    cin >> R;
    int t,n,m,s;
    rep(i, R) {
      cin >> t >> n >> m >> s;
      pc[n].push_back(pi(t, m));
    }

    cin >> Q;
    int ts, te, mq;
    rep(i, Q) {
      int ans = 0;
      vector<bool> flag(1300, false);
      cin >> ts >> te >> mq;
      for (int i = 1; i <= N; ++i) {
        for (int j = 0; j < pc[i].size(); j += 2) {
          pi begin = pc[i][j], end = pc[i][j+1];
          if (begin.second != mq) continue;
          // cout << begin.first << " " << end.first << endl;
          int ps = max(ts, begin.first);
          int pe = min(te, end.first);
          rep_r(i, pe, ps) flag[i] = true;
        }
      }
      rep_r(i, te, ts) if(flag[i]) ans += 1;
      cout << ans << endl;
    }
  }
}

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

int table[10001][1261];

int main(){
  int N, M, r, q, t, s, n, m,ts,te;

  while(cin >> N >> M, N && M){
    cin >> r;
    for(int i = 0; i < r; i++){
      cin >> t >> n >> m >> s;
      if(s) table[m][t]++;
      else  table[m][t]--;
    }
    for(int i = 0; i <= M; i++){
      for(int j = 540; j <= 1260; j++){
	table[i][j] += table[i][j-1];
      }
    }
 
    for(int i = 0; i <= M; i++){
      for(int j = 540; j <= 1260; j++){
	//if(i == 1)cout << table[i][j] << endl;
	if(table[i][j] > 1) table[i][j] = 1;
	table[i][j] += table[i][j-1];
      }
    }
    cin >> q;
    for(int i = 0; i < q; i++){
      cin >> ts >> te >> m;
      cout << table[m][te] - table[m][ts] << endl;
    }
    /*for(int i = 540; i < 1260; i++) {cout << i << " " << table[1][i];
    if(i == te || i == ts) cout << "ttt";
    cout << endl;}
    */
  }
}

C++: #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio> 
#include <cstring>

#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rangeRep(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
struct Student {
	int t, n, m, s;
};

constexpr int timeOffset = 540;
//[PC][??????] = ????????????
int dp[1000][1260 - timeOffset] = { 0 };


class Solve {
public:
	Solve() {};
	~Solve() {};

	void solver() {
		std::vector<std::vector<int>> results;
		while (1) {
			int n, m, r, q;
			std::vector<Student> students;
			std::cin >> n >> m;
			if (!n) break;

			std::memset(dp, 0, sizeof(dp));
			
			results.push_back(std::vector<int>());
			//?????°???????????±
			std::cin >> r;
			Student s;
			rep(i, r) {
				//??????, PC??????, ????????????, isLogin
				std::cin >> s.t >> s.n >> s.m >> s.s;
				//?????°??????
				if (s.s) {
					//?????°??????????§???????????????????
					dp[s.n - 1][s.t - timeOffset] = s.m;
				}//?????°??¢??????
				else {
					//?????°????????¨????????§?????£?????????
					int time = s.t - timeOffset - 1;
					do{
						dp[s.n - 1][time--] = s.m;
					} while (dp[s.n - 1][time] == 0);
				}
			}

			//?????? [ts, te]??????????????????m????????¨??????
			std::cin >> q;
			rep(i, q) {
				int num = 0;
				int ts, te, m;
				std::cin >> ts >> te >> m;
				ts -= timeOffset; te -= timeOffset;
				//???????????????PC??§?????°?????????????????????????????????
				rangeRep(j, ts, te) {
					rep(k, 1000) {
						if (dp[k][j] == m) {
							num++;
						}
					}
				}
				results.back().push_back(num);
			}
		}

		for (auto& x : results) {
			for (auto& y : x) {
				std::cout << y << std::endl;
			}
		}
	}
private:

};

int main() {
	Solve solve;
	solve.solver();
	getchar(); getchar();
	return 0;
}