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 <stdio.h>
#include <vector>
#include <utility>
using namespace std;

typedef struct{
	int t,s; // time gakuseiNo
}dat;

int main(void){
	int N,M;
	int a,b,c,d;
	int ts,te,m;
	int r,q;
	vector<dat> kiroku[10001]; // ??????
	while(cin>>N>>M,N||M){
		cin>>r;
		for(int i=0;i<r;i++){
			cin>>a>>b>>c>>d;
			dat temp;
			temp.t=a;
			temp.s=d;
			kiroku[c].push_back(temp);
		}

		cin>>q;
		for(int XX=0;XX<q;XX++){
			int total=0;
			int start=0;
			int gakuseiuse=0;
			int i=0;
			cin>>ts>>te>>m;

			// prev
			for(i=0;i<kiroku[m].size()&&kiroku[m][i].t<ts;i++){
				if(kiroku[m][i].s==1)gakuseiuse++;
				else  gakuseiuse--;
			}
			if(gakuseiuse>0)start=ts;

			// now
			for(;i<kiroku[m].size()&&kiroku[m][i].t<te;i++){
				// printf("debug %d,%d:%d,%d\n",m,i,kiroku[m][i].t,kiroku[m][i].s);
				if(kiroku[m][i].s==1){
					// login
					gakuseiuse++;
					if(gakuseiuse==1){
						start=kiroku[m][i].t;
					}
				}
				else if(kiroku[m][i].s==0){
					// logout
					gakuseiuse--;
					if(gakuseiuse==0){
						total+=kiroku[m][i].t-start;
					}
				}
			}
			// end
			if(gakuseiuse>=1){
				total+=te-start;
			}
			cout<<total<<endl;
		}
		for(int i=0;i<M;i++)kiroku[i].clear();
	}
	return 0;
}

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

typedef struct{
  int time;
  bool inout;
} Data;

int main(){
  int n,m;
  while(cin>>n>>m,n){
    int r,q;
    Data data;
    vector<vector<Data> > vec(m);
    cin>>r;
    for(int i=0;i<r;i++){
      int t,pc,number,check;
      cin>>t>>pc>>number>>check;
      data.time=t;
      data.inout=(bool)check;
      vec[number-1].push_back(data);
    }
    cin>>q;
    for(int i=0;i<q;i++){
      int ts,te,number;
      cin>>ts>>te>>number;
      number--;
      int time=ts;
      int check=0;
      int sum=0;
      for(int i=0;i<(int)vec[number].size();i++){
	data = vec[number][i];
	if(data.inout) check++;
	else check--;
	if(ts <= data.time && data.time <= te){
	  if(data.inout && check == 1) time=data.time;
	  if(!data.inout&& check == 0){ 
	    sum += data.time-time;
	    time=data.time;
	  }
	}
	if(data.time > te){
	  sum+=te-time;
	  break;
	}
      }
      cout<<sum<<endl;
    }
  }
  return 0;
}

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)
#define erev(i, m, n) for(int (i)=(n); (i)>=(m); (i)--)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define pb            push_back
template<class T, class S> inline pair<T, S> mp(T x, S y){ return make_pair(x, y); }
template<class T, class S> inline bool minup(T& m, S x){ return m>(T)x ? (m=(T)x, true) : false; }
template<class T, class S> inline bool maxup(T& m, S x){ return m<(T)x ? (m=(T)x, true) : false; }

static const int    INF = 1000000000;
static const ll     MOD = 1000000007LL;
static const double EPS = 1E-12;

const int MAX_M = 11111;
const int MAX_R = 1111;
const int MAX_T = 800;
int id[MAX_M][MAX_T];
int N, M;
int r, q;
struct _R{int t, m, n, s;} R[MAX_R];
int ts, te, m;

int main()
{
  while(cin >> N >> M, N){
    rep(i, M) rep(j, 777) id[i][j] = 0;
    cin >> r;
    rep(i, r) cin >> R[i].t >> R[i].n >> R[i].m >> R[i].s;
    rep(i, r) if(!R[i].s) R[i].s = -1;

    rep(i, r) id[R[i].m - 1][R[i].t - 540] += R[i].s;
    rep(i, M) rrep(j, 1, 777) id[i][j] += id[i][j - 1];

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

  return 0;
}

C++: #include <iostream>
#include <limits.h>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

int N,M,r,q;
typedef struct{
	int t,n,m,s;
} LOG;

void solve()
{
	cin>>r;
	vector<LOG> logs(r);
	for(int i = 0;i < r; i++){
		cin >> logs[i].t >> logs[i].n >> logs[i].m >> logs[i].s;
	}
	cin >> q;
	for(int i = 0;i < q; i++){
		int ts,te,m;
		cin >> ts >> te >> m;
		int count = 0,ans = 0,t = 0;
		for(int j = 0; j < r; j++){
			if(logs[j].m != m) continue;

			if(logs[j].s == 1 && count == 0){
				t = max(logs[j].t,ts); //Jn
			} else if(logs[j].s == 0 && count == 1){
				ans += max(min(logs[j].t,te) - t,0); 
			}

			if(logs[j].t >= te){
				if(count > 1) //ñdOC
					ans += te - t; //ð«·
				break;
			}

			count += (logs[j].s == 1) ? 1 : -1; //JEgð¸³¹é
		}
		cout << ans << endl;
	}


}

int main()
{
	while(cin >>N >>M,(N||M)){
		solve();
	}
	return 0;
}