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;
#define int long long
#define pb push_back 
#define pf push_front 
#define mp make_pair
#define fr first
#define sc second
#define Rep(i,n) for(int i=0;i<(n);i++)
#define All(v) v.begin(),v.end()
typedef pair<int, int> Pii; typedef pair<int, Pii> Pip;
const int INF = 1107110711071107;

int state[10001][10261];
int pc[10001];

main()
{
  int N, M;
  while( cin >> N >> M, !(N == 0 && M == 0) ) {
    int r, q;

    fill_n(*state, 10001*10261, 0);

    cin >> r;
    Rep(i, r) {
      int t, n, m, s;
      cin >> t >> n >> m >> s;
      if( s ) pc[n] = t;
      else {
	for(int j=pc[n]; j<t; j++) {
	  state[m][j] = 1;
	}
      }
    }

    cin >> q;
    Rep(i, q) {
      int ts, te, m;
      cin >> ts >> te >> m;
      
      int sum = 0;
      for(int j=ts; j<te; j++) sum += state[m][j];
      
      cout << sum << endl;
    }
    
  }

}

C++: #include<iostream>
#include<map>

std::map<int, char> use[10001];
std::map<int, bool> stu[10001];
int N,M,r,t,n,m,s;

void init(){
	int tmp = 0;
	for(int m=1; m<=M; m++){
		for(int i=540; i<=1260; i++){
			if(tmp)
				stu[m][i] = true;
			if(use[m][i]){
				if(use[m][i] == 'u')
					tmp++;
				else
					tmp--;
			}
		}
	}
}

int solve(int s, int e, int m){
	int ans = 0;
	int tmp = 0;
	for(int i=540; i<=1260; i++){
		if(tmp && i>s && i<=e)
			ans++;
		if(use[m][i]){
			if(use[m][i] == 'u')
				tmp++;
			else
				tmp--;
		}
	}

	return ans;
}

int main(){
using namespace std;
	while(1){
		cin >> N >> M;
		if(!N && !M)
			break;
			
		cin >> r;
		for(int i=0; i<r; i++){
			cin >> t >> n >> m >> s;
			if(s)
				use[m][t] = 'u';
			else
				use[m][t] = 'd';
		}
		//init();
		
		cin >> r;
		for(int i=0; i<r; i++){
			cin >> s >> t >> m;
			cout << solve(s,t,m) << endl;
		}
		
		for(int i=1; i<=M; i++){
			use[i].clear();
			stu[i].clear();
		}
	}
	
	return 0;
}

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

#define rep(i,a,b) for(int i=a;i<b;i++)

const int inf = 1001001000;
//const int mod = 1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

int digitlen(long long i){
    long long t = i;
    int count = 0;
    while(t){
        count += 1;
        t /= 10;
    }
    return count;
}

vector<int> cumsum(vector<int> arr){
    vector<int> ret;
    int l = arr.size();
    ret.push_back(arr[0]);
    for(int i = 1; i < l; i++){
        ret.push_back(ret[i-1] + arr[i]);
    }
    return ret;
}

vector<int> eratosthenes(int n){
    int arr[n+1];
    rep(i,0,n+1){
        arr[i] = 1;
    }
    arr[0] = 0; arr[1] = 0;
    for(int i = 2; i < n; i++){
        if(arr[i]==1){
            for(int j = 2*i; j < n+1; j+=i){
                arr[j] = 0;
            }
        }
    }
    
    vector<int> ret;
    for(int i = 2; i<n+1; i++){
        if(arr[i] == 1){
            ret.push_back(i);
        }
    }
    return ret;

}


int main(){
    while(true){
        int n,m;
        cin >> n >> m;
        if(n == 0 && m == 0) return 0;
        int r;
        cin >> r;

        int arr[m][720];

        rep(i,0,m){
            rep(j,0,720){
                arr[i][j] = 0;
            }
        }

        rep(i,0,r){
            int t,n,m,s;
            cin >> t >> n >> m >> s;
            if(s == 1){
                arr[m-1][t-540] += 1;
            }else{
                arr[m-1][t-540] -= 1;
            }
        }

        rep(i,0,m){
            rep(j,1,720){
                arr[i][j] = arr[i][j-1] + arr[i][j]; 
            }
        }

        int q;
        cin >> q;

        rep(i,0,q){
            int ans = 0;
            int ts,te,m;
            cin >> ts >> te >> m;
            rep(j,ts-540,te-540){
                if(arr[m-1][j] > 0) ans++;
            }
            cout << ans << endl;
        }

    }

}

C++: #include<iostream>
 
using namespace std;
 
#define MMAX 10000
#define tMAX (60*24)
int main(){
 
    int N, M;
    int r;
    int t, n, m1, s;
    int q;
    int ts, te, m2;
    int num,cnt;
    int data[MMAX+1][tMAX+1];
 
    while (1){
        cin >> N >> M;
        if (N == 0 && M == 0) break;
        for (int i = 0; i <= MMAX; i++){
            for (int j = 0; j <= tMAX; j++){
                data[i][j] = 0;
            }
        }
        cin >> r;
        for (int i = 0; i < r; i++){
            cin >> t >> n >> m1 >> s;
            if (s == 0) data[m1][t]=-1;
            else data[m1][t]=1;
        }
        cin >> q;
        for (int i = 1; i <= M; i++){
            num = 0;
            for (int j = 0; j <= tMAX; j++){
                num += data[i][j];
                data[i][j] = num;
            }
        }
        for (int i = 0; i < q; i++){
            cin >> ts >> te >> m2;
            cnt = 0;
            for (int j = ts; j < te; j++){
                if (data[m2][j] >= 1) cnt++;
            }
            cout << cnt << endl;
        }
    }
    return 0;
}