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

typedef pair<int, int> pi;

int main() {
	int M, T, P, R;
	while(cin >> M >> T >> P >> R && M){
		int m, t, p, c, wrong[64][16] = {0};
		pi team[64];
		for(int i = 0; i <= T; ++i)
			team[i] = pi(0, 0);
			
		for(int i = 0; i < R; ++i){
			scanf("%d%d%d%d", &m, &t, &p, &c);
			if(c == 0){
				team[t].first--;
				team[t].second += m + wrong[t][p];
			}
			else{
				wrong[t][p] += 20; 
			}
		}
		pi rnk[64];
		for(int i = 0; i <= T; ++i)
			rnk[i] = team[i];
			
		sort(team, team + T + 1);
		pi prev;
		bool is_out[64] = {0};
		for(int i = 0; i < T; ++i){
			for(int j = T; j >= 1; --j){
				if(rnk[j].first == team[i].first && rnk[j].second == team[i].second && !is_out[j]){
					if(i){
						if(prev.first == team[i].first && prev.second == team[i].second)
							cout << "=";
						else
							cout << ",";
					}
					cout << j;
					is_out[j] = true;
					prev = pi(team[i].first, team[i].second);
					break;
				}
			}
		}
		cout << endl;
	}
	return 0;
}

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

#define REP(i,n) for( int i = 0; i < n; i++ )


using namespace std;

/*
 より多くの問題に正解したチームを上位とする．
 正解した問題数が同じ場合は，所要時間合計の少ないチームを上位とする．
 複数のチームが同数の問題に正解し，所要時間合計も同じなら，それらのチームを同順位とする．
 */

struct team{
	int ans,time,name;
    int q[50]={0};
    
	team() : ans(0), time(0), name(0) {}
    
    bool operator <( const team& Right )const {
        return  ans != Right.ans ? ans < Right.ans :
        time != Right.time ? time > Right.time :
        name <  Right.name;
    }
};


int main()
{
	int M,T,P,R;
	// Mは，コンテストの始まりから終わりまでの時間である． Tは，チーム数である． Pは，問題数である． Rは，提出記録の数である
	while( cin >> M >> T >> P >> R )
	{
		int m,t,p,k;
		vector<team> team_array(T+1);
		if( T == 0 ) return 0;
		for( int i = 1; i <= T; i++)
			team_array[i].name = i;
		// mkは，経過時間である． tkは，チーム番号である． pkは，問題番号である． jkは，判定結果を表す（0なら正解，0以外なら不正解）
		REP(i,R)
		{
			cin >> m >> t >> p >> k;
			team &tm = team_array[t];
			if( !k ){
				tm.ans++;
				tm.time += m;
                if( tm.q[p] )
                    tm.time += 20 * tm.q[p];
			}
            else{
                tm.q[p]++;
            }
            
		}
		
        sort( team_array.begin() + 1 , team_array.end() );
		
        for( int i = T; i > 0; i-- )
        {
            char c;
            if( i == 1 ){
                cout << team_array[i].name << endl;
                continue;
            }
            else if ( team_array[i].ans == team_array[i-1].ans &&
                team_array[i].time == team_array[i-1].time) {
                c = '=';
            }
            else{
                c = ',';
            }
			cout << team_array[i].name << c;
        }
        
	}
	return 0;

C++: #include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

int main() {
	int M,T,P,R;
	while(true){
		cin >> M >> T >> P >> R;
		if(M==0) return 0;
		vector<int> m(R),t(R),p(R),j(R);
		REP(i,R){
			cin >> m[i] >> t[i] >> p[i] >> j[i];
			t[i]--;
		}
		vector<vector<int>> pena(T,vector<int>(P));
		vector<vector<int>> score(T,vector<int>(2)); //seikai,jikan

		REP(i,R){
			if(j[i] == 0){
				score[t[i]][0]++;
				score[t[i]][1]+=pena[t[i]][p[i]] + m[i];
			}
			pena[t[i]][p[i]]+=20;
		}

		vector<tuple<int,int,int>> tupleScore(T);
		REP(i,T){
			tupleScore[i] = make_tuple(-score[i][0],score[i][1],-1-i);
		}
		sort(ALL(tupleScore));

		int top;
		tie(ignore,ignore,top) = tupleScore[0];
		cout << -top;
		REP(i,T-1){
			int ans1,tim1,ans2,tim2;
			tie(ans1,tim1,ignore)=tupleScore[i];
			tie(ans2,tim2,top)=tupleScore[i+1];
			if(ans1==ans2 && tim1==tim2){
				cout << "=" << -top;
			}
			else{
				cout << "," << -top;
			}
		}

		cout << endl;	
	}
	return 0;
}