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;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
int t[1005], n[1005], m[1005], s[1005];
int ts[55], te[55], M1[55];
int ans[55];
int num[10005];
int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    while(true) {
        int N, M, r, q;
        cin >> N >> M;
        if(N == 0) break;
        cin >> r;
        for(int i = 1; i <= M; i++) num[i] = 0;
        for(int i = 1; i <= r; i++) {
            cin >> t[i] >> n[i] >> m[i] >> s[i];
        }
        cin >> q;
        for(int i = 1; i <= q; i++) {
            cin >> ts[i] >> te[i] >> M1[i];
            ans[i] = 0;
        }
        for(int time = 540; time <= 1260; time++) {
            for(int i = 1; i <= r; i++) {
                if(t[i] != time) continue;
                if(s[i] == 1) num[m[i]]++;
                else num[m[i]]--;
            }
            for(int i = 1; i <= q; i++) {
                if(ts[i] > time || te[i] <= time) continue;
                if(num[M1[i]] > 0) ans[i]++;
            }
        }
        for(int i = 1; i <= q; i++) cout << ans[i] << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<cstring>
using namespace std;
int x[10000][1440],n,m,r,q,i,j,a,b,c,d,s;
int main() {
	while (true) {
		memset(x, 0, sizeof(x));
		cin >> n >> m >> r;
		for (i = 0; i < r; i++) {
			cin >> a >> b >> c >> d;
			if (d == 1) {
				for (j = a; j < 1440; j++) {
					x[c][j] = 1;
				}
			}
			else {
				for (j = a; j < 1440; j++) {
					x[c][j] = 0;
				}
			}
		}
		cin >> q;
		for (i = 0; i < q; i++) {
			s = 0;
			cin >> a >> b >> c;
			for (j = a; j < b; j++) {
				if (x[c][j] == 1) { s++; }
			}
			cout << s << endl;
		}
	}
}

C++: #include <iostream>
#include <stdio.h>
#include <ctype.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;


int main (){
  
  int pc,stu;
  
  while(1){

    cin >>pc>>stu;
    if (pc==0&&stu==0)break;
    
    int i,j,k,srec,sque,t,n,m,s,ts,te,sum;
    int record[pc][721];
    
    for(i=0;i<pc;i++){
      for(j=0;j<721;j++){
	record[i][j]=0;
      }
    }

    //record入力
    cin >>srec;
    for(i=0;i<srec;i++){
      cin >>t>>n>>m>>s;
      n--;
      
      if (s==1){
	//ログイン
	for(j=t-540;j<721;j++){
	  //if (j==19)cout<<"19"<<endl;
	  record[n][j] = m;
	  //cout <<"n="<<n<<" j="<<j<<" record="<<record[n][j] <<endl;
	}
      }else{
	//ログアウト
	for(j=t-540;j<721;j++){
	  record[n][j] = 0;
	}
      }
    }
    
    //記録チェック
    cin >> sque;
    for(i=0;i<sque;i++){
      sum = 0;
      cin >> ts >>te >>m;
      for(j=ts-540;j<te-540;j++){
	for(k=0;k<pc;k++){
	  if (record[k][j]==m){
	    sum += 1;
	    break;
	  }
	}
      }
      cout << sum <<endl;
    }

  }
    
  return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <climits>
#include <cassert>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF INT_MAX/3
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cout<<#x<<":"<<x<<endl
#define debug2(x,y) cout<<#x","<<#y":"<<x<<","<<y<<endl

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

void solve(int N,int M){
    vector<vector<int>> imos(10001,vi(800,0));
    int r;
    cin >> r;
    REP(i,r){
        int t,n,m,s;
        cin >> t >> n >> m >> s;
        t -= 540;
        m--;
        if(s==1) imos[m][t]++;
        else imos[m][t]--;
    }

    for(int i=0;i<M;i++){
        for(int j=0;j<800;j++){
            imos[i][j+1] += imos[i][j];
        }
    }


    int q;
    cin >> q;
    REP(i,q){
        int ts,te,m;
        cin >> ts >> te >> m;
        m--;
        ts -= 540;
        te -= 540;
        int cnt=0;
        for(int j=ts;j<te;j++){
            if(imos[m][j]>0) cnt++;
        }
        cout << cnt << endl;
    }
}

int main(){
    int n,m;
    while(cin>>n>>m){
        if(n==0 && m==0) break;
        solve(n,m);
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
 
typedef long long ll;
typedef pair<int, int> ii;

int main() {
	
	ll N, M;
	while(cin >> N >> M, N, M){
		vector<vector<int>> use(M);
		vector<int> cnt(M);
		int r;
		cin >> r;
		rep(i, r){
			int t, n, m, s;
			cin >> t >> n >> m >> s; m--;
			if(s == 0){//log out
				cnt[m]--;
				if(cnt[m] == 0) use[m].push_back(t);
				
			}else{//log in
				if(cnt[m] == 0) use[m].push_back(t);
				cnt[m]++;
			}
		}
		int q;
		cin >> q;
		rep(i, q){
			int ts, te, m;
			cin >> ts >> te >> m; m--;
			int ans = 0;
			for(int j = 0; j < use[m].size(); j += 2){
				if(ts < use[m][j+1] || use[m][j] < te) ans += (min(te, use[m][j+1]) -  max(ts, use[m][j]));
			}
			cout << ans << endl;
		}
		
	}
	
	
	return 0;
}