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

int main()
{
loop:
  int min = 1 << 30, max = 0, sum = 0, n;
  cin >> n;
  if(!n)
    return 0;
  for(int i = 0; i < n; i++)
  {
    int tmp;
    cin >> tmp;
    max = max < tmp ? tmp : max;
    min = min > tmp ? tmp : min;
    sum += tmp;
  }
  cout << (sum - max - min) / (n - 2) << endl;
  goto loop;
}

C++: 
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <set>
#include <map>
#include <cstring>
#include <cstdio>
#include <stack>
#define INF 1000000000
#define rep(i,n) for(int i =0;i<n;i++)
using namespace std;
typedef long long int ll;

int main(){
    for(;;){
        int N,M;
        cin >> N>>M;
        if(!N and !M)break;
        int r;
        cin >> r;
        vector<int> g(10001*721,0);
        map<pair<int,int>, int> hoge;
        for (int i=0; i<r; i++) {
            int t,n,m,s;
            cin >>t>>n>>m>>s;
            t-=540;
            if (s==1) {
                hoge[{m,n}]=t;
            }else{
                for (int j=hoge[{m,n}];j<t; j++) {
                    g[m*721 + j] = 1;
                }
            }
        }
        int q;
        cin >>q;
        for (int qq = 0; qq < q; qq++) {
            int ts,te,m,ans = 0;
            cin >> ts >> te >>m;
            for (int i= ts-540; i<te-540; i++) {
                if (g[m*721+i] == 1) {
                    ans++;
                }
            }
            cout << ans <<endl;
        }
    }
}

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

using namespace std;

const int MaxN = 1001;
const int MaxM = 10001;

int N, M;

int main() {
  int count[MaxM];

  while(cin>>N>>M && !(N==0 && M==0)) {
    vector < vector< pair<int,int> > > logg(MaxM);
    int r;
    cin>>r;
    int t,n,m,s;
    for(int i=0; i<MaxM; i++) { // 初期化
      count[i] = 0;
    }
    for(int i=0; i<r; i++) {
      cin>>t>>n>>m>>s;
      if(s == 1) { // login
	count[m]++;
	if(count[m] == 1) {
	  logg[m].push_back(make_pair(t,t));
	}
      }
      else { // logout
	count[m]--;
	if(count[m] == 0) {
	  logg[m].back().second = t;
	}
      }
    }
    int q;
    cin>>q;
    for(int i=0; i<q; i++) {
      int ts, te, m, ans = 0;
      cin>>ts>>te>>m;
      int ans1, ans2; // 4debug ans1は誤りらしい
      for(int j=0; j<logg[m].size(); j++) {
	if(logg[m][j].first <= te) {
	  ans1 = min(te, logg[m][j].second)-max(ts, logg[m][j].first);
	}
	ans2 = max(0, min(te,logg[m][j].second)-max(ts,logg[m][j].first));
	/*
        if(ans1!=ans2) {
	  cout<<"Q: "<<ts<<" "<<te<<endl;
	  cout<<"why: "<<min(te, logg[m][j].second)-max(ts, logg[m][j].first)<<endl;
	  cout<<"val: "<<logg[m][j].first<<" "<<logg[m][j].second<<endl;
	  cout<<"ans: "<<ans1<<" "<<ans2<<endl;
	}
	*/
        ans += ans2;
      }
      cout<<ans<<endl;
    }
  }
}

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

#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define MP make_pair
using namespace std;

typedef vector<int> vi;
typedef pair<int, int> P;

int main(){
	int N, M;
	while(cin >> N >> M, N|M){
		vector<int> rec(N);
		vector<vi> stu(M, vi(1300, 0));
		int r;
		cin >> r;
		while(r--){
			int t, n, m, s;
			cin >> t >> n >> m >> s;
			n--, m--;
			if(s){
				rec[n] = t;
			}else{
				for(int i = rec[n]; i < t; i++){
					stu[m][i] = 1;
				}
			}
		}
		int q;
		cin >> q;
		while(q--){
			int t1, t2, m;
			cin >> t1 >> t2 >> m;
			m--;
			int ans = 0;
			for(int i = t1; i < t2; i++){
				ans += stu[m][i];
			}
			//cout << "***";
			cout << ans << endl;
		}

	}

	return 0;
}

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

int t[1005];
bool used[10005][1000];

int main(){
	int n,m,r,q;
	int a,b,c,d;
	int i,j,k;
	while(cin>>n>>m){
		if(!n)break;
		memset(used,false,sizeof(used));
		cin>>r;
		for(i=0;i<r;i++){
			cin>>a>>b>>c>>d;
			a-=540,b--,c--;
			if(d==1)t[b]=a;
			else{
				for(j=t[b];j<a;j++)used[c][j]=true;
			}
		}
		cin>>q;
		for(i=0;i<q;i++){
			cin>>a>>b>>c;
			a-=540,b-=540,c--,d=0;
			for(j=a;j<b;j++)if(used[c][j])d++;
			cout<<d<<endl;
		}
	}
}