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
#define MAX_DATA 1 << 17
using namespace std;

typedef pair<int,int> P;

template <class T>
class SegmentTree
{
private :
    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 <iostream>
#include <cstdio>
#include <vector>
#include <map>

using namespace std;
#define loop(i,a,b) for(int i=(a);i<int(b);i++)
#define rep(i,b) loop(i,0,b)

int main(){
    int N,M;
    while(scanf("%d%d",&N,&M)!=EOF && N|M){
        typedef pair<int,int> pii;
        typedef vector<pii> vp;
        typedef vector<vp> vvp;
        typedef vector<vvp> vvvp;
        vvvp v(N+1,vvp(M+1));
        int r;scanf("%d",&r);
        rep(i,r){
            int t,n,m,s;
            scanf("%d%d%d%d",&t,&n,&m,&s);
            if(s){
                v[n][m].emplace_back(t,0);
            }else{
                v[n][m].back().second = t;
            }
        }

        continue;
        int q;scanf("%d",&q);
        rep(i,q){
            int s,e,m;
            int ans=0;
            scanf("%d%d%d",&s,&e,&m);
            bool use[2000]={};
            loop(j,1,N+1)rep(k,v[j][m].size()){
                auto t=v[j][m][k];
                if(e<t.first || t.second<s) continue;
                int E=min(t.second,e);
                int S=max(t.first,s);
                if(S>E)continue;
                loop(w,S,E)use[w]=true;
                // printf("%d %d %d %d\n",S,E,m,x);
            }
            rep(j,2000)if(use[j])ans++;
            cout<<ans<<endl;
        }
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back 
#define pf push_front 
#define mp make_pair
#define fr first
#define sc second
#define Rep(i,n) for(int i=0;i<(n);i++)
#define All(v) v.begin(),v.end()
typedef pair<int, int> Pii; typedef pair<int, Pii> Pip;
const int INF = 1107110711071107;

int state[1001][1261];

main()
{
  int N, M;
  while( cin >> N >> M, !(N == 0 && M == 0) ) {
    int r, q;
    int pc[10001];

    fill_n(*state, 1001*1261, 0);

    cin >> r;
    Rep(i, r) {
      int t, n, m, s;
      cin >> t >> n >> m >> s;
      if( s ) pc[n] = t;
      else {
	for(int j=pc[n]; j<t; j++) {
	  state[m][j] = 1;
	}
      }
    }

    cin >> q;
    Rep(i, q) {
      int ts, te, m;
      cin >> ts >> te >> m;
      
      int sum = 0;
      for(int j=ts; j<te; j++) sum += state[m][j];
      
      cout << sum << endl;
    }
    
  }

}