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 <iostream>
#include <stdio.h>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
#include <math.h>
#include <utility>
#include <stack>
using namespace std;
typedef pair<int,int> P;
const int INF = (int)((unsigned int)-1>>1);

struct team{
    int mis[10];
    int m,n,t;
    team(){
        fill(mis,mis+10,0);
        m = 0;
        n = 0;
        t = 0;
    }
};

bool cmp(const team& left, const team& right){
    if (left.n == right.n){
        if (left.m == right.m){
            return left.t > right.t;
        }else{
            return left.m < right.m;
        }
    }else{
        return left.n > right.n;
    }
}

int main(){
    while(1){
        int M,T,P,R;
        cin >> M >> T >> P >> R;
        if (M==0)break;

        vector<team> g(T);
        for(int i=0;i<T;i++) g[i].t = i+1;
        for(int i=0;i<R;i++){
            int m,t,p,j;
            cin >> m >> t >> p >>j;
            t--;p--;
            //printf("%d %d %d %d\n",m,t,p,j);
            if (j==0){
                g[t].n += 1;
                g[t].m += m + g[t].mis[p]*20;
            }else{
                g[t].mis[p] += 1;
            }
        }

        sort(g.begin(),g.end(),cmp);
        printf("%d",g[0].t);
        for(int i=1;i<T;i++){
            if(g[i].n == g[i-1].n && g[i].m == g[i-1].m){
                printf("=%d",g[i].t);
            }else{
                printf(",%d",g[i].t);
            }
        }
        printf("\n");
    }
}

C++: #include <bits/stdc++.h>
  
using namespace std;
typedef long long ll;
  
#define rep(i, n) for(int i=0; i<(n); ++i)
 
class team {
public:
    int id, solve, time, miss[11];
    bool operator<(const team & rhs) const{
        if(solve > rhs.solve) return true;
        else if(solve==rhs.solve && time < rhs.time) return true;
        else if(solve==rhs.solve && time == rhs.time && id > rhs.id) return true;
        return false;
    }
};
int main(void){
    int M, T, P, R;
    int m, t, p, j;
    team teams[51];
    while(cin >> M >> T >> P >> R && M) {
        rep(i, T) {
            teams[i].id = i+1;
            teams[i].solve = 0;
            teams[i].time = 0;
            rep(j, P) teams[i].miss[j] = 0;
        }
        rep(i, R) {
            cin >> m >> t >> p >> j;
            t--;
            if(j == 0) {
                teams[t].solve++;
                teams[t].time += m + teams[t].miss[p] * 20;
            } else {
                teams[t].miss[p]++;
            }
        }
        sort(teams, teams+T);
        rep(i, T-1) {
        rep(i, T) {
            printf("%d: %d %d\n", teams[i].id, teams[i].solve, teams[i].time);
        }
            cout << teams[i].id;
            if(teams[i].solve==teams[i+1].solve && teams[i].time==teams[i+1].time) {
                cout << "=";
            } else {
                cout << ",";
            }
        }
        cout << teams[T-1].id << endl;
    }
}

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

class team{
public:
	int num, ans, time;
	team(int n){
		num = n;
		ans = time = 0;
	}
	bool operator<(const team &t2)const{
		if (ans != t2.ans)
			return ans > t2.ans;
		else if (time != t2.time)
			return time < t2.time;
		else
			return num > t2.num;
	}
};

int　main()
{
	int M, T, P, R, m[2001], t[2001], p[2001], r[2001], before;
	while (cin >> M >> T >> P >> R, (M || T || P || R)){
		vector<team> v;
		vector<team>::iterator pv;
		//入力
		for (int i = 0; i < R; i++){
			cin >> m[i] >> t[i] >> p[i] >> r[i];
		}

		//各チームの時間
		for (int i = 1; i <= T; i++){
			team te = team(i);
			for (int j = 0; j < R; j++){
				//正解時間の計算
				if (t[j] == i && r[j] == 0){
					te.time += m[j];
					te.ans++;
					//以前のペナルティを計算
					for (int k = 0; k < j; k++){
						if (t[k] == i && p[k] == p[j]){
							te.time += 20;
						}
					}
				}
			}
			v.push_back(te);
		}

		//ソート
		sort(v.begin(), v.end());
		pv = v.begin();
		before = -1;
		while (pv != v.end()){
			if (before == pv->time)
				cout << "=" << pv->num;
			else {
				if (pv == v.begin())
					cout << pv->num;
				else
					cout << "," << pv->num;
				before = pv->time;
			}
			pv++;
		}
		cout << endl;
		v.~vector();
	}
	return 0;
}