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 S[10000][1261]={};

int main()
{
  int N,M,r,q,t,n,m,s,ts,te,time;

  while(1){
    cin>>N>>M;
    if(N==0 && M==0)break;
    for(int i=0;i<M;i++){
      for(int j=0;j<=1261;j++)S[i][j]=0;
    }
    cin>>r;
    for(int i=0;i<r;i++){
      cin>>t>>n>>m>>s;
      if(s==1)S[m-1][t]++;
      else S[m-1][t]--;
    }
    for(int i=0;i<M;i++){
      for(int j=1;j<=1261;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;j<te;j++){
	if(S[m-1][j]>0)time++;
      }
      cout<<time<<endl;
    }
  }
  return 0;
}

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

int main(){
    int n,m,r,q;
    while(cin>>n>>m,n){
        cin>>r;
        vector<vector<int>> usert(m);
        vector<int> userh(m,0);
        for(int i=0;i<r;i++){
            int t,n,m,s;
            cin>>t>>n>>m>>s;
            m--;
            if(s==1){
                if(userh[m]==0)
                    usert[m].push_back(t);
                userh[m]++;

            }
            if(s==0){
                if(userh[m]==1)
                    usert[m].push_back(t);
                userh[m]--;

            }


        }
        cin>>q;
        for(int i=0;i<q;i++){
            int ts,te,m;
            cin>>ts>>te>>m;
            m--;
            int cnt=0;
            bool isusin=0;
            for(int i=0;i<usert[m].size();i++){
                if(!isusin){
                    isusin=1;
                }
                else{
                    isusin=0;

                    int span=min(usert[m][i],te)-max(usert[m][i-1],ts);
                    if(span>=0)
                        cnt+=span;
                }
            }
            cout<<cnt<<endl;
        }





    }
}

C++: #include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define RFOR(i,m,n) for(int i=m;i>=n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265


void f(int n,int m){
  int v[1300][1100]={};
  bool e[1300]={};
  int r;
  cin>>r;
  rep(i,r){
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    e[c]=true;
    if(d==1){
      v[c][a]++;
    }
    if(d==0){
      v[c][a]--;
    }
  }

  rep(i,1300){
    if(!c[i]) continue;
    FOR(j,540,1100){
      v[i][j]+=v[i][j-1];
    }
    FOR(j,540,1100){
      v[i][j]=(v[i][j]>0);
    }
    FOR(j,540,1100){
      v[i][j]+=v[i][j-1];
    }
  }


  int q;
  cin>>q;
  rep(i,q){
    int a,b,c;
    cin>>a>>b>>c;
    cout<<v[c][b-1]-v[c][a-1]<<endl;
  }

}


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

  return 0;
}

C++: #include<vector>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
  int i,j;
  int b[10000],m,n,o;
  int sm;
  vector<int> a[10000];
  while(cin>>n>>m&&n+m){
    cin>>o;
    for(i=0;i<m;i++)
      a[i].clear();
    memset(b,0,sizeof(b));
    for(i=0;i<o;i++){
      int p,q,r,s;
      cin>>p>>q>>r>>s;
      r--;
      if(s){
	if(b[r]==0)
	  a[r].push_back(p);
	b[r]++;
      }else{
	b[r]--;
	if(b[r]==0)
	  a[r].push_back(p);
      }
    }
    cin>>o;
    for(i=0;i<o;i++){
      int p,q,r;
      cin>>p>>q>>r;
      r--;
      if(a[r].size()){
	sm=0;
	for(j=0;j<(int)a[r].size();j+=2){
	  if(0){
	  }else if(a[r][j]<p&&a[r][j+1]>q){
	    sm+=q-p;
	    break;
	  }else if(a[r][j]>=p&&a[r][j+1]<=q){
	    sm+=a[r][j+1]-a[r][j];
	  }else if(a[r][j]>=q){
	  }else if(a[r][j+1]<=p){
	    break;
	  }else if(a[r][j]>p){
	    sm+=q-a[r][j];
	    break;
	  }else if(a[r][j+1]<q){
	    sm+=a[r][j+1]-p;
	  }
	}
	cout<<sm<<endl;
      }else
	cout<<0<<endl;
    }
  }
  return 0;
}