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 <cstring>
using namespace std;

int students[10001][800] = {};
int numlogin[10001] = {};
int sum[10001][800]={};

int main(){

  while(1){
    int N,M,r;
    cin >> N >> M;
    if(!N and !M) break;
    cin >> r;

    memset(students,0,sizeof(students));
    memset(numlogin,0,sizeof(numlogin));
    memset(sum,0,sizeof(sum));

    // ?¨????
    for(int i=0; i<r; i++){ // 1000
      int t,n,m,s;
      cin >> t >> n >> m >> s;
      t -= 540;
      if(s == 0) { // ?????°??¢??????
	numlogin[m]--;
	if(numlogin[m] == 0){
	  for(int i=t-1; students[m][i] != 1 and t>=0; i--){ // 1000
	    students[m][i] = 1;
	  }
	}
      }
      else{ // ?????°??????
	numlogin[m]++;
	if(numlogin[m] == 1)
	  students[m][t] = 1;
      }
    }

    // ?´???????
    for(int i=1; i<=M; i++){ // 100000
      for(int j=1; j<=720; j++){ // 1000
	sum[i][j] = sum[i][j-1] + students[i][j]; 
      }
    }

    // ??????
    int  q;
    cin >> q;
    for(int i=0; i<q; i++){
      int ts,te,id;
      cin >> ts >> te >> id;
      ts -= 540;
      te -= 540;
      cout << sum[id][te-1] - sum[id][ts] + students[id][ts] << endl;
    }
  }
}

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

using namespace std;

struct DATA{
  int info1;
  int info2;
};

vector<DATA> Convert(vector<DATA>);
int getTime(vector<DATA>, int, int);

int main(){
  int i, j, n, m, r, q, time, log, t1, t2, ans;
  DATA _data;

  while(1){
    cin >> n >> m;
    if(n == 0 && m == 0) break;

    vector< vector<DATA> > data1(m), data2;
    cin >> r;

    for(i=0; i<r; ++i){
      cin >> time >> n >> m >> log;
      _data.info1 = time;
      _data.info2 = log;
      data1[m-1].push_back(_data);
    }

    for(i=0; i<data1.size(); ++i)
      data2.push_back(Convert(data1[i]));

    cin >> q;

    for(i=0; i<q; ++i){
      cin >> t1 >> t2 >> m;
      cout << getTime(data2[m-1], t1, t2) << endl;
    }
  }
  return 0;
}

vector<DATA> Convert(vector<DATA> data1){
  int i, j, in_count, out_count;
  DATA _data;
  vector<DATA> data2;

  i = 0;
  j = i;
  in_count = 0;
  out_count = 0;
  while(j < data1.size()){
    if(data1[j].info2 == 1) ++in_count;
    else ++out_count;

    if(in_count == out_count){
      _data.info1 = data1[i].info1;
      _data.info2 = data1[j].info1;
      data2.push_back(_data);
      i = j + 1;
      in_count = 0;
      out_count = 0;
    }
    ++j;
  }

  return data2;
}

int getTime(vector<DATA> data, int start, int end){
  int i, ans;

  for(i=0, ans=0; i<data.size(); ++i){
    if(data[i].info1 > start && data[i].info2 > end)
      ans += (end - data[i].info1);
    else if(data[i].info1 < start && data[i].info2 < end)
      ans += (data[i].info2 - start);
    else if(data[i].info1 < start && data[i].info2 > end)
      ans += (end - start);
    else
      ans += (data[i].info2 - data[i].info1);
  }
  return ans;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f(i,x,n) for(int i=x;i<(int)(n);++i)
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100005,INF=1<<29;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    while(1){
        int N,M;cin>>N>>M;
        if(N+M==0) break;
        
        vector<vector<int>> S(M,vector<int>(1300));
        
        int R;cin>>R;
        
        for(int i=0;i<R;i++){
            int a,b,c,d;cin>>a>>b>>c>>d;
            c--;
            if(d==1){
                S[c][a+1]++;
            }else{
                S[c][a+1]--;
            }
        }
        
        for(int i=0;i<M;i++){
            for(int j=1;j<1300;j++){
                S[i][j]+=S[i][j-1];
            }
        }
        
        int Q;cin>>Q;
        
        while(Q--){
            int a,b,c;cin>>a>>b>>c;
            c--;
            int sum=0;
            
            for(int i=a+1;i<=b;i++){
                if(S[c][i]) sum++;
            }
            
            cout<<sum<<endl;
        }
    }
    
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct P{
  int t;
  int pc;
  int st;
  int lg;
};

int func(vector<P> vec, int ts, int te, int u)
{
  int r, s, p, q;
  r = s = q = 0;

  for(int i = 0; i < vec.size() && vec[i].t <= ts; i++, q++){
    if(vec[i].st == u){
      if(vec[i].lg == 1){
	s++;
      } else {
	s--;
      }
    }
  }
  if(s > 0){
    p = ts;
  } else {
    p = te;
  }

  for(int i = q; i < vec.size() && vec[i].t <= te; i++){
    if(s > 0){
      for(; i < vec.size() && vec[i].t <= te; i++){
	if(vec[i].st == u){
	  if(vec[i].lg == 1){
	    s++;
	  } else {
	    s--;
	    if(s == 0){
	      r += (vec[i].t - p);
	      break;
	    }
	  }
	}
      }
    } else {
      for(;i < vec.size() && vec[i].t <= te; i++){
	if(vec[i].st == u && vec[i].lg == 1){
	  s++;
	  p = vec[i].t;
	  break;
	}
      }
    }
  }

  if(s > 0){
    r += (te - p);
  }

  return r;
}

int main()
{
  int n, m, q, r, s, t, u;
  P p;

  while(cin>>n>>m && (n+m)){
    cin >> r;
    vector<P> vec;
    for(int i = 0; i < r; i+=1){
      cin >> p.t >> p.pc >> p.st >> p.lg;
      vec.push_back(p);
    }

    cin >> q;
    while(q--){
      cin >> s >> t >> u;
      cout << func(vec, s, t, u) << endl;
    }
  }

  return 0;
}