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 <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<iostream>
#include<string>
using namespace std;
int main(){
	int solved[50];
	int time[50][10];
	int team[50];
	int m,t,p,r;
	while(true){
	cin>>m>>t>>p>>r;
	if(m==0&&t==0&&p==0&&r==0)
		break;
	for(int i=0;i<t;i++){
		solved[i]=0;
		for(int j=0;j<p;j++)
			time[i][j]=0;
		team[i]=i+1;
	}
	for(int i=0;i<r;i++){
		int a[4];
		for(int j=0;j<4;j++)
			cin>>a[j];
		if(a[3]==0)
			solved[a[1]-1]+=50000-time[a[1]-1][a[2]-1]-a[0];
		else
			time[a[1]-1][a[2]-1]+=20;
	}
	for(int i=0;i<t-1;i++){
		for(int j=t-1;j>i;j--){
			if(solved[j]>solved[j-1]||(solved[j]==solved[j-1]&&team[j]>team[j-1])){
				int tmp=solved[j];
				solved[j]=solved[j-1];
				solved[j-1]=tmp;
				tmp=team[j];
				team[j]=team[j-1];
				team[j-1]=tmp;
			}
		}
	}
	cout<<team[0];
	for(int i=1;i<t;i++){
		if(solved[i]==solved[i-1])
			cout<<"=";
		else
			cout<<",";
		cout<<team[i];
	}
	cout<<endl;
	}
	return 0;
}

C++: #include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(i, (v).size()) { cout << v[i]; if (i != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	while (1) {
		int M, T, P, R;
		cin >> M >> T >> P >> R;
		if (!M)break;
		vector<vector<bool>> ac(T, vector<bool>(P, false));
		vvi pen(T, vi(P, 0));
		vvi last(T, vi(P, 0));
		REP(i, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if (j == 0) {
				ac[t - 1][p - 1] = true;
				last[t - 1][p - 1] = m;
			}
			else pen[t - 1][p - 1] += 20;
		}
		vector<pair<pii,ll>> point(T);
		REP(i, T) {
			int acc = 0, time = 0;
			REP(j, P) {
				if (ac[i][j]) {
					time += last[i][j] + pen[i][j];
					acc--;
				}
			}
			point[i] = { { acc,time },-i };
		}
		sort(ALL(point));
		string ret = "";
		REP(i, T - 1) {
			ret += to_string((-1)*point[i].second+1);
			if (point[i].first == point[i + 1].first)ret += '=';
			else ret += ',';
		}
		ret += to_string((-1)*point[T-1].second + 1);
		cout << ret << endl;
	}


	return 0;
}