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++: #ifndef _WIN32
#include<iostream>
#endif
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<string>
#include<stdlib.h>

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

using namespace std;
int M, T, P, R;
int score[51];
int times[51];
int pen[51][11];//
int con[51][11];
int team[11]; 

#define SCORE 0
#define TIME 1
#define ID 2
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(30);
	while (1){
		vector<vector<int>> all;
		cin >> M >> T >> P >> R;
		if (M == 0 && T == 0)break;
		REP(i, 51){
			REP(j, 11){
				pen[i][j] = 0;
				con[i][j] = -1;
			}
			score[i] = 0;
			times[i] = 0;
		}

		REP(i, R){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			if (m <= M){
				if (j == 0){
					con[t][p] = m;
				}
				else{
					pen[t][p] ++;
				}
			}
		}
		REP(i, T){
			REP(j, 11){
				if (con[i][j] != -1){
					score[i]++;
					times[i] += con[i][j] + 20 * pen[i][j];
				}
			}
			all.push_back({ score[i], -times[i], i+1 });
		}
		sort(all.begin(), all.end());
		reverse(all.begin(), all.end());
		REP(i, T){
			cout << all[i][ID];
			if (i == T - 1){
				cout << endl;
			}else{
				if (all[i][SCORE] == all[i + 1][SCORE] && all[i][TIME] == all[i+1][TIME]){
					cout << "=";
				}
				else{
					cout << ",";
				}
			}
		}
	}
	return 0;
}

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

int main(){
	while(true){
		int M,T,P,R;
		cin>>M>>T>>P>>R;
		if(M==0&&T==0&&P==0&&R==0)
			break;
		int CP[50],TT[50],PT[50][10];
		for(int i=0;i<T;i++){
			CP[i]=TT[i]=0;
			for(int j=0;j<P;j++)
				PT[i][j]=0;
		}
		for(int i=0;i<R;i++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			if(j==0){
				CP[t-1]++;
				TT[t-1] += (m+PT[t-1][p-1]);
			}else{
				PT[t-1][p-1] +=20;
			}
		}

		int tnow,tpre=-1;
		bool flg[50];
		for(int i=0;i<T;i++)
			flg[i]=false;
		for(int i=0;i<T;i++){
			tnow=-1;
			for(int j=0;j<T;j++){
				if(flg[j])
					continue;
				if(tnow==-1){
					tnow=j;
				}else{
					if(CP[j]>CP[tnow]||(CP[j]==CP[tnow]&&TT[j]<=TT[tnow])){
						tnow=j;
					}
				}
			}
		if(tpre!=-1){
			if(CP[tnow]==CP[tpre]&&TT[tnow]==TT[tpre])
				cout<<'=';
			else
				cout<<',';
		}
		cout << tnow+1;
			flg[tnow]=true;
			tpre=tnow;
		}
	cout<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,a,n) for(int i=a; i<(n); i++)
#define X first
#define Y second

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

int main(){

	int m,t,p,r;
	while( cin >> m >> t >> p >> r, m|t|p|r ){
		int sumtime[t+1];
		int ac[t+1];
		int wrong[t+1][p+1];
		int num[t+1];

		rep(i,t+1){
			rep(j,p+1){
				wrong[i][j] = 0;
			}
			ac[i]=0;
			sumtime[i] = 0;
			num[i] = i;
		}
		rep(k,r){
			int tmpm,tmpt,tmpp,tmpj;
			cin >> tmpm >> tmpt >> tmpp >> tmpj;
			if(tmpj) wrong[tmpt][tmpp]++;
			else{
				sumtime[tmpt] += tmpm + wrong[tmpt][tmpp] * 20;
				ac[tmpt] ++;
			}
		}
//		rep(i,t) cout << "ac=" <<ac[i] << endl;
		for(int i = 1; i < t;i++){
//		reps(i,1,t-1){
			for(int j = i+1; j <= t;j++){
	//		reps(j,i+1;t){
				if(ac[i] < ac[j] || (ac[i]==ac[j] && sumtime[i]> sumtime[j]) ||
				 (ac[i]==ac[j] && sumtime[i] == sumtime[j] && num[i] < num[j])){
					swap(ac[i],ac[j]);
					swap(sumtime[i],sumtime[j]);
					swap(num[i],num[j]);
				}
			}
		}
		for(int i = 1; i < t;i++){
//		reps(i,1,t-1){
			if(ac[i] == ac[i+1] && sumtime[i] == sumtime[i+1]){
				cout << num[i] << "=";
			}
			else{
				cout << num[i] << ",";
			}
		}
		cout << num[t] << endl;

	}
	return 0;
}

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

int q[55][2];// num, time
int wr[55][15];
vector<tuple<int,int,int> > v1;

int main(){
	int m,t,p,r;
	int i,j,k;
	int a,b,c,d;
	int bef[3];
	while(cin>>m>>t>>p>>r){
		if(!m)break;
		v1.clear();
		memset(wr,0,sizeof(wr));
		memset(q,0,sizeof(q));
		for(i=0;i<r;i++){
			cin>>a>>b>>c>>d;
			b--;
			if(d==0){
				q[b][0]++,q[b][1]+=wr[b][c]*20+a;
			}else wr[b][c]++;
		}
		for(i=0;i<t;i++){
			v1.push_back(make_tuple(q[i][0],-q[i][1],i));
		}
		sort(v1.rbegin(),v1.rend());
		for(i=0;i<t;i++){
			tie(a,b,c)=v1[i];
			if(i!=0){
				if(bef[0]==a && bef[1]==b)cout<<"=";
				else cout<<",";
			}
			cout<<c+1;
			bef[0]=a,bef[1]=b,bef[2]=c;
		}
		cout<<endl;
	}
}