Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		M, T, P, R := io.NextInt(), io.NextInt(), io.NextInt(), io.NextInt()
		if M == 0 {
			break
		}
		score := make([]struct{ num, time, index int }, T)
		submit := make([][]int, T)
		for i := 0; i < T; i++ {
			score[i].index = i + 1
			submit[i] = make([]int, P)
		}

		for i := 0; i < R; i++ {
			m, t, p, j := io.NextInt(), io.NextInt()-1, io.NextInt()-1, io.NextInt()
			if j == 0 {
				score[t].num++
				score[t].time += submit[t][p]*20 + m
			} else {
				submit[t][p]++
			}
		}
		sort.SliceStable(score, func(i, j int) bool {
			return score[i].num < score[j].num || score[i].num == score[j].num && score[i].time > score[j].time
		})

		for i := T - 1; i > 0; i-- {
			io.Printf("%d", score[i].index)
			if score[i].num == score[i-1].num && score[i].time == score[i-1].time {
				io.Printf("=")
			} else {
				io.Printf(",")
			}
		}
		io.Println(score[0].index)
	}
}

// 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 <bits/stdc++.h>
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;

const double PI  = acos(-1);
const double EPS = 1e-10;
typedef complex <double> P;
/*
 * 実数         : p.real() or real(p)
 * 虚数         : p.imag() or imag(p)
 * 偏角         : arg(p)
 * 長さ         : abs(p)
 * ノルム       : norm(p)
 * 共役な複素数 : conj(p)
 */

P turn(P p,double t){ //t度回転
    return p * exp( P(.0, t * PI / 180.0 ) ); // ベクトルにe^θiをかけている
}

int main() {
    int n;
    while (cin >> n, n) {
        vector <vector <P>> line, gen(4);
        rep (i, n + 1) {
            int m;
            cin >> m;
            vector <P> tmp;
            int x0, y0;
            rep (j, m) {
                int x, y;
                cin >> x >> y;
                if (j == 0) {
                    x0 = x, y0 = y;
                    x = y = 0;
                }
                else {
                    x -= x0, y -= y0;
                }
                if (i == 0) {
                    gen[0].emplace_back(x * -1, y * -1);
                    gen[1].emplace_back(x, y);
                    swap(x, y);
                    gen[2].emplace_back(x, y * -1);
                    gen[3].emplace_back(x * -1, y);
                }
                else {
                    tmp.emplace_back(x, y);
                }
            }
            if (i == 0) {
                int sz = gen.size();
                rep (j, sz) {
                    vector <P> rev = gen[j];
                    int x0 = rev.back().real(), y0 = rev.back().imag();
                    rep (k, gen[j].size()) {
                        rev[k].real(rev[k].real() - x0);
                        rev[k].imag(rev[k].imag() - y0);
                    }
                    reverse(rev.begin(), rev.end());
                    gen.push_back(rev);
                }
            }

            if (i != 0) line.push_back(tmp);
        }

        rep (i, line.size()) {
            rep (j, gen.size()) {
                bool flag = true;
                rep (k, gen[j].size()) {
                    flag &= gen[j][k] == line[i][k];
                }
                if (flag) {
                    cout << i + 1 << endl;
                    break;
                }
            }
        }
        cout << "+++++" << endl;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int x[99][2],y[99][20],n,a,b,c,d,e,f,g,h,p,i,j,k;
int main() {
while(true) {
memset(x,0,sizeof(x));memset(y,0,sizeof(y));
cin>>n>>a>>b>>c;
if(n==0){break;}
for(i=0;i<c;i++){
cin>>d>>e>>f>>g;
if(g!=0){y[e][f]+=20;}
else{x[e][1]+=d+y[e][f];x[e][0]++;}
}p=0;
for(i=b;i>=0;i--){
for(j=0;j<=99999;j++){h=0;
for(k=a;k>0;k--){
if(x[k][0]==i&&x[k][1]==j){
if(h>=1){cout<<'=';}else if(p>=1){cout<<',';}cout<<k;p++;h++;
}
}}}
cout<<endl;}}

C++: #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
typedef pair<ll, int> pll;

int main()
{
  int M,T,P,R;
  int i = 0;
  while(cin>>M>>T>>P>>R, M||T||P||R) {
    if(i) cout << '\n';
    int A[T+1],times[T+1],pena[T+1],miss[T+1][P+1];
    CLR(A);CLR(times);CLR(pena);CLR(miss);
    FOR(i,0,R) {
      int m,t,p,j; cin >> m >> t >> p >> j;
      if(j==0) {
        A[t]++;
        times[t] = m;
        pena[t] += miss[t][p] * 20;
      } else {
        miss[t][p]++;
      }
    }
    vector<pll> score(T);
    FOR(i,1,T+1) {
      ll s = A[i] * 10000000000000 - pena[i] - times[i];
      score[i-1] = pll(s, i);
    }
    sort(score.rbegin(), score.rend());
    int j = 1;
    ll now = score[0].first;
    vector<vector<int> > ans(T+1);
    FOR(i,0,T) {
      if(now > score[i].first) {
        j++;
        now = score[i].first;
      }
      ans[j].push_back(score[i].second);
    }
    FOR(i,1,T+1) {
      if((int)ans[i].size() > 0) {
        if(i!=1) cout << ',';
        vector<int> pr;
        FOR(j,0,(int)ans[i].size()) {
          pr.push_back(ans[i][j]);
        }
        sort(pr.rbegin(), pr.rend());
        FOR(j,0,(int)pr.size()) {
          if(j!=0 && j!=pr.size()) cout<<'=';
          cout << pr[j];
        }
      }
    }
    i++;
  }
  return 0;
}