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>
using namespace std;
	int m,t,p,r;
struct team{
int id=0;
int ac=0;
int time[100];
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;
	}
}

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

const int INF=50000000;

int data[51][12];

int main(){
	int M,T,P,R;
	while(cin>>M>>T>>P>>R && M){
		fill((int*)data,(int*)(data+12),0);
		for(int i=0;i<R;i++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			if(j==0){
				data[t][0]++;
				data[t][11]+=m+data[t][p]*20;
			}
			else data[t][p]++;
		}
		int prev[2]={INF,0};
		for(int i=0;i<T;i++){
			int ans=0;
			int now[2]={0,INF};
			for(int j=T;j>=0;j--){
				if(data[j][0]>now[0]){
					now[0]=data[j][0];
					now[1]=data[j][11];
					ans=j;
				}
				else if(data[j][0]==now[0] && data[j][11]<now[1]){
					now[1]=data[j][11];
					ans=j;
				}
			}
			if(i){
				if(memcmp(now,prev,sizeof(now))==0)cout<<"=";
				else cout<<",";
			}
			cout<<ans;
			memcpy(prev,now,sizeof(now));
			data[ans][0]=-1;
		}
		cout<<endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
struct Score {
    int team;
    int times=0;
    int correct=0;
};
int main(void){
    int M,T,P,R;
    while (cin>>M>>T>>P>>R) {
        if (M==0&&T==0&&P==0&&R==0) {
            break;
        }
        int incorrect[T+1][P+1];
        for (int i=1;i<=T;i++) {
            for (int j=1;j<=P;j++) {
                incorrect[i][j]=0;
            }
        }
        struct Score score[T+1];
        for (int i=1;i<=T;i++) {
            score[i].team=i;
        }
        int m,t,p,j;
        for (int i=0;i<R;i++) {
            cin>>m>>t>>p>>j;
            if (j==0) {
                score[t].correct++;
                score[t].times+=incorrect[t][p]+m;
            } else {
                incorrect[t][p]+=20;
            }
        }
        for (int i=1;i<T;i++) {
            for (int j=i+1;j<=T;j++) {
                if (score[i].correct<score[j].correct) {
                    swap(score[i],score[j]);
                }
            }
        }
        for (int i=1;i<T;i++) {
            for (int j=i+1;j<=T;j++) {
                if (score[i].correct==score[j].correct) {
                    if (score[i].times>score[j].times) {
                        swap(score[i],score[j]);
                    } else if (score[i].times==score[j].times) {
                        if (score[i].team<score[j].team) {
                            swap(score[i],score[j]);
                        }
                    }
                }
            }
        }
        int tmp_correct;
        int tmp_times;
        for (int i=1;i<=T;i++) {
            if (i==1) {
                cout<<score[i].team;
            } else {
                if (score[i].correct==tmp_correct) {
                    if (score[i].times==tmp_times) {
                        cout<<"="<<score[i].team;
                    } else {
                        cout<<","<<score[i].team;
                    }
                } else {
                    cout<<","<<score[i].team;
                }
            }
            tmp_correct=score[i].correct;
            tmp_times=score[i].times;
        }
        cout<<endl;
    }
}