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 <string>
#include <vector>
using namespace std;

int main() {
    int N, M;
    while (cin >> N >> M, N || M) {
        int dp[10001][722] = {0};
        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++: #pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
struct data{
    int a,b,c,d;
};
int main(){
  while(1){
      ll n,m;
      cin>>n>>m;
      if(n==0)return 0;
      int r;
      cin>>r;
      V<data> dat(r);
      for(int i=0;i<r;i++){
          cin>>dat[i].a>>dat[i].b>>dat[i].c>>dat[i].d;
      }
       int q;
      cin>>q;
      V<data> query(q);
      map<int,int> mp;
      V<bool> used(m,false);
      int cnt=0;
      for(int i=0;i<q;i++){
          cin>>query[i].a>>query[i].b>>query[i].c;
          if(!used[query[i].c-1]){
              mp[query[i].c-1]=cnt++;
              used[query[i].c-1]=true;
          }  
      }
      V<V<ll>> tim(cnt,V<ll>(1270,0)),sum(cnt,V<ll>(1270,0));
      for(int i=0;i<r;i++){
          if(!used[dat[i].c-1])continue;
          if(dat[i].d){
              tim[mp[dat[i].c-1]][dat[i].a]++;
          }else{
              tim[mp[dat[i].c-1]][dat[i].a]--;
          }
      }
      for(int i=0;i<cnt;i++){
          for(int j=0;j<1265;j++){
              tim[i][j+1]+=tim[i][j];
          }
      }
      for(int i=0;i<cnt;i++){
          for(int j=0;j<1265;j++){
              sum[i][j+1]+=(tim[i][j]>0)+sum[i][j];
          }
      }
      for(int i=0;i<q;i++){
          cout<<sum[mp[query[i].c-1]][query[i].b]-sum[mp[query[i].c-1]][query[i].a]<<"\n";
      }
  }
}