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 <vector>
#include <algorithm>
#include <map>
#define INF 1 << 28
using namespace std;

typedef pair<int,int> P;

template <class T>
class SegmentTree
{
private :
    const int MAX_DATA = 1 << 17;
    int n;
    vector<T> data;
public :
    void init(int);
    void update(int, int);
    int query(int, int, int, int, int);
    int size();
    T top();
};

template <class T>
void SegmentTree<T>::init (int n_) {
    n = 1;
    while (n < n_ + 1) n *= 2;
    data.resize(n * 2);
    for (int i = 0; i < data.size(); i++) data[i] = 0;
}

template <class T>
void SegmentTree<T>::update (int k_, int l_) {
    for (int i = k_; i <= 1260 && i < l_; i++) {
        int tmp_ = i + n - 1;
        data[tmp_] = 1;
        while (tmp_) {
            tmp_ = (tmp_ - 1) / 2;
            data[tmp_] = data[tmp_ * 2 + 1] + data[tmp_ * 2 + 2];
        }
    }
}

template <class T>
int SegmentTree<T>::query (int a_, int b_, int k_, int l_, int r_) {
    if (r_ <= a_ || b_ <= l_) return 0;

    if (a_ <= l_ && r_ <= b_) {
        return data[k_];
    }
    else {
        T vl = query(a_, b_, k_ * 2 + 1, l_, (l_ + r_) / 2);
        T vr = query(a_, b_, k_ * 2 + 2, (l_ + r_) / 2, r_);

        return (vl + vr);
    }
}

template <class T>
int SegmentTree<T>::size () {
    return n;
}

template <class T>
T SegmentTree<T>::top () {
    return data[0];
}

int main()
{
    int N, M;
    while (cin >> N >> M, (N || M)) {
        int R;
        cin >> R;

        vector<SegmentTree<int> > p(M + 1);
        for (int i = 0; i < p.size(); i++) {
            p[i].init(1260);
        }
        map<P,int> dat;
        for (int i = 0; i < R; i++) {
            int t, n, m, s;
            cin >> t >> n >> m >> s;

            if (s) {
                dat[P(n,m)] = t;
            } else {
                int tmp = dat[P(n,m)];
                auto ite = dat.find(P(n,m));
                dat.erase(ite);
                p[m].update(tmp, t);
            }
        }

        for (auto i : dat) {
            p[i.first.second].update(i.second, INF);
        }

        int Q;
        cin >> Q;
        for (int i = 0; i < Q; i++) {
            int ts, te, m;
            cin >> ts >> te >> m;
            cout << p[m].query(ts, te, 0, 0, p[m].size()) << endl;
        }
    }



    return 0;
}

C++: #include <cstdio>
#include <utility>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#define REP(i,n) for(int i=0;i<n;i++)
typedef long long ll;
using namespace std;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;

int ans[1261][10001]={};


int main() 
{
	int N,M;
	while(cin>>N>>M&&!(N==0&&N==0)){ //N=pc  M=students
		
		REP(j,1261){REP(k,10001){ans[j][k]=0;}}	
		
		int r;	cin>>r;
		for(int i=0;i<r;i++){
			int t,m,n,s;
			cin>>t>>n>>m>>s;
			m--;n--;
			
			if(s==1){
				for(int j=t;j<1260;j++){
					ans[j][m]++;
				}
			}
			else{
				for(int j=t;j<1260;j++){
					ans[j][m]--;
				}
			}
		}
		
		int q;	cin>>q;
		for(int i=0;i<q;i++){
			int s,e,m;
			cin>>s>>e>>m;
			m--;
			int tmp(0);
			for(int j=s;j<e;j++){
				if(ans[j][m]>0){
					tmp++;
				}
			}
			cout<<tmp<<endl;
		}
	}
	return 0;
}

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

int main()
{
  int N,M,r,q,t,n,m,s,S[10001][721],ts,te,time;

  while(1){
    cin>>N>>M;
    if(N==0 && M==0)break;
    for(int i=1;i<=M;i++){
      for(int j=0;j<=720;j++)S[i][j]=0;
    }
    cin>>r;
    for(int i=0;i<r;i++){
      cin>>t>>n>>m>>s;
      if(s==1)S[m][t-540]=1;
      else S[m][t-540]=-1;
    }
    for(int i=1;i<=M;i++){
      for(int j=1;j<=720;j++){
        S[i][j]+=S[i][j-1];
      }
    }
    cin>>q;
    for(int i=0;i<q;i++){
      cin>>ts>>te>>m;
      time=0;
      for(int j=ts-540;j<te-540;j++){
	if(S[m][j]>0)time++;
      }
      cout<<time<<endl;
    }
  }
  return 0;
}

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

using namespace std;
 
#define MMAX 10000
#define tMAX (60*24)

int main(void){
 
    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 (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]--;
            else data[m1][t]++;
        }
		
        for (int i = 1; i <= M; i++){
            num = 0;
            for (int j = 0; j <= tMAX; j++){
                num += data[i][j];
                data[i][j] = num;
            }
        }
		cin>>q;
        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++;
            }
            printf("%d\n",cnt);
        }
    }
    return 0;
}