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;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (b - 1); i >= a; i--)
#define RREP(i, n) RFOR(i, 0, n)
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define rrep(i, a, b) for (auto i = a; i > b; i--)
#define fs first
#define sc second
//typedef pair<int, int> P;


int M, T, P, R;


class Team
{
public:
	int id;
	int score = 0;
	int time = 0;
	vector<int> pena = vector<int>(P);

	bool operator<(const Team & a)const
	{
		if (score == a.score)
		{
			if (time == a.time)
			{
				return id > a.id;
			}
			return time < a.time;
		}
		return score > a.score;
	}

};


bool solve()
{
	cin >> M >> T >> P >> R;
	if (M == 0)return false;

	vector<Team> tL(T);
	REP(i, T)
	{
		tL[i].id = i + 1;
	}

	REP(i, R)
	{
		int m, t, p, j;
		cin >> m >> t >> p >> j;
		--t; --p;
		if (j == 0)
		{
			tL[t].score++;
			tL[t].time += m + tL[t].pena[p];
		}
		else
		{
			tL[t].pena[p] += 20;
		}
	}

	sort(tL.begin(), tL.end());

	cout << tL[0].id;
	FOR(i, 1, T)
	{
		if (tL[i].score == tL[i - 1].score && tL[i].time == tL[i - 1].time)
		{
			cout << "=";
		}
		else
		{
			cout << ",";
		}
		cout << tL[i].id;
	}
	cout << endl;

	return true;
}


int main()
{
	while (solve())
	{

	}

	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];
    
	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"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	b += MOD;
	a += b;
	a %= MOD;
}

struct team{
	int id;
	int point;
	int time;
};

bool y[55][11];
int f[55][11];
team s[55];

bool comp(team a, team b){
	return ((a.point==b.point)?((a.time==b.time)?(a.id>b.id):(a.time<b.time)):(a.point>b.point));
}

int main(void){
	int M,T,P,R,m,t,p,j,i;
	while(true){
		cin >> M >> T >> P >> R;
		if(!(M || T || P || R)){
			break;
		}
		for(i=0; i<T; ++i){
			s[i].id=(i+1);
			s[i].point=0;
			s[i].time=0;
		}
		fill(y[0],y[55],true);
		fill(f[0],f[55],0);
		for(i=0; i<R; ++i){
			cin >> m >> t >> p >> j;
			--t; --p;
			if(j && y[t][p]){
				++f[t][p];
			}else if(!j){
				s[t].point += 1;
				s[t].time += m;
				s[t].time += 20*f[t][p];
				y[t][p] = false;
			}
		}
		sort(s,s+T,comp);
		for(i=0; i<T; ++i){
			cout << ((i)?((s[i-1].point==s[i].point&&s[i-1].time==s[i].time)?"=":","):"") << s[i].id;
		}
		cout << endl;
	}
	return 0;
}