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 <string>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>

using namespace std;

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


#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define INF 1<<30
#define mp make_pair
#define pb push_back

#define fi first
#define se second

#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)

typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pii;

typedef long long ll;

class team{
public:
	int id;
	int clear;
	vi fail;
	int time;
	team(){
		id=0;
		clear=0;
		fail = vi(10,0);
		time=0;
	}
};

int main(){
	while(1){
		int M,T,P,R;
		int m,t,p,j;
		vector<team> tev;
		vector<pii> ap; 
		cin>>M>>T>>P>>R;
		if(M==0)break;
		rep(i,T){
			team te;
			te.id=i+1;
			te.clear=0;
			te.time=0;
			tev.pb(te);
			//????????§id??????????????°??????????????????clear,time???0??§?????????
		}
		rep(i,R){
			cin>>m>>t>>p>>j;
			if(j==0){
				int time=m;
				//????????§?????£?§£??°????????????????????????????????£?§£??°??¨????????????????????????
				time += tev[t-1].fail[p]*20;
				tev[t-1].clear++;
				tev[t-1].time+=time;
			}else{
				//????????§???????????????????????¨????????£?§£?????°?????????
				tev[t-1].fail[p]++;
			}
		}
		rep(i,T){
			ap.pb(mp(tev[i].clear*100000+(90000-tev[i].time),tev[i].id));
		}
		sort(rall(ap));

		cout<<ap[0].se;
		REP(i,1,T){
			if(ap[i-1].fi==ap[i].fi) cout<<"=";
			else cout<<",";
			cout<<ap[i].se;
		}
		cout<<endl;
		// rep(i,T){
		// 	cout<<"debug clear:"<<tev[i].clear<<" time:"<<tev[i].time;
		// 	cout<<endl;
		// 	rep(j,P){
		// 		cout<<" fail:"<<tev[i].fail[j];
		// 	}
		// 	cout<<endl;
		// }

	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;

const ll MOD=1e9+7;
const ll INF=1e18;

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



int main(){
	int M,T,P,R;
	while(1){
		cin >> M >> T >> P >> R;
		if(M == 0) break;
		int sum[55][15] = {};
		int passed[56] = {};
		int solved[56] = {};
		for(int i = 0;i < R;i++){
			int m,t,p,j;
			cin >> m >> t >> p >> j;
			if(j == 0){
				passed[t] += m + sum[t][p];
				solved[t]++;
			}else{
				sum[t][p] += 20;
			}
		}
		int ban = 0;
		int ch[55] = {};
		while(ban != T){
			if(ban != 0) cout << ",";
			int max_sol = -1,min_time = 1000000;
			for(int i = 1;i <= T;i++){
				if(ch[i] == 0 && solved[i] > max_sol){
					max_sol = solved[i];
					min_time = passed[i];
				}else if(ch[i] == 0 && solved[i] == max_sol && passed[i] < min_time){
					min_time = passed[i];
				}
			}
			int douritu = 0;
			for(int i = T;i >= 1;i--){
				if(ch[i] == 0 && solved[i] == max_sol && passed[i] == min_time){
					ban++;
					ch[i] = 1;
					if(douritu == 0){
						cout << i;
					}else{
						cout << "=" << i;
					}
					douritu++;
				}
			}
		}
		cout << endl;
		
		
	}




}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int m,t,p,r;
class team{
public:
int id;
int ac;
int time[200];
bool ok[200];
};

int or(team a,team b){//aのほうが強ければ1,bなら0,同じなら2
if(a.ac>b.ac)return 1;
else if(a.ac<b.ac)return 0;
int at=0,bt=0;
for(int i=0;i<=p;i++){
if(a.ok[i]==true)at+=a.time[i];
if(b.ok[i]==true)bt+=b.time[i];
}
if(at<bt)return 1;
else if(at>bt)return 0;
else return 2;
}
int main(){

	while(true){
	cin>>m>>t>>p>>r;
	if(m+t+p+r==0)break;
	vector<team>ta(0);
	ta.resize(200);

	for(int i=0;i<=t;i++)for(int j=0;j<200;j++)ta[i].time[j]=0,ta[i].ok[j]=0;
	for(int i=0;i<=t;i++)ta[i].id=i,ta[i].ac=0;
	for(int i=0;i<r;i++){
	int a,b,c,d;
	cin>>a>>b>>c>>d;//a:経過時間:bチーム番号c:問題番号j:0奈良正解それ以外不正解
	if(d==0){
	ta[b].time[c]+=a;
	ta[b].ac++;
	ta[b].ok[c]=true;
	}
	else {
	ta[b].time[c]+=20;
	}
	}
	ta.erase(ta.begin());
	for(int i=0;i<t;i++){
	for(int j=0;j<t;j++){
	if(or(ta[i],ta[j])==1)swap(ta[i],ta[j]);
	if(or(ta[i],ta[j])==2&&ta[i].id>ta[j].id)swap(ta[i],ta[j]);
	}
	}
	for(int i=0;i<t-1;i++){
	if(or(ta[i],ta[i+1])!=2)cout<<ta[i].id<<",";
	else cout<<ta[i].id<<"=";
	}
	cout<<ta[t-1].id<<endl;
	}
	return 0;
}