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 <algorithm>

using namespace std;

int main() {
    while(true) {
        int M, T, P, R;
        cin >> M >> T >> P >> R;

        int m, t, p, j;
        int result[T];
        fill(result, result + T, 0);
        int time[T];
        fill(time, time + T, 0);
        int failure[T];
        fill(failure, failure + T, 0);
        for (int submit = 0; submit < R; submit++) {
            cin >> m >> t >> p >> j;
            if (j == 0) {
                result[t - 1] += 1;
                time[t - 1] += m + failure[t - 1] * 20;
            } else {
                ++failure[t - 1];
            }
        }

        bool done[T];
        fill(done, done + T, false);
        int prevPoint, prevTime;
        for (int count = 0; count < T; count++) {
            int maxPoint = -1;
            int maxTeam = 0;
            int minTime = 100000;
            for (int i = T - 1; i >= 0; i--) {
                if (done[i]) continue;
                if (maxPoint < result[i]) {
                    maxPoint = result[i];
                    maxTeam = i + 1;
                    minTime = time[i];
                } else if (maxPoint == result[i]) {
                    if (minTime > time[i]) {
                        minTime = time[i];
                        maxTeam = i + 1;
                    }
                }
            }
            minTime = time[maxTeam - 1];
            if (count != 0) {
                if (maxPoint == prevPoint && minTime == prevTime) cout << "=";
                else cout << ",";
            }
            cout << maxTeam;
            done[maxTeam - 1] = true;
            prevPoint = maxPoint;
            prevTime = minTime;
        }
        cout << endl;
    }
    return 0;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#include<cctype>

#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
#define range(x,min,max) ((min) <= (x) && (x) <= (max))

using namespace std;

typedef long long LL;
typedef vector<int> VI;
typedef vector<vector<int> > VII;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef pair<int,int> PII;

const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};

int M, T, P, R;

struct Score {
	Score() {
		count = 0;
		time = 0;
	}
	int team;
	int count;
	int time;

	bool operator < (const Score& right) const {
		if (count != right.count) {
			return count > right.count;
		}
		if (time != right.time) {
			return time < right.time;
		}
		return team > right.team;
	}
};

int main(){
	cin.tie(0);
   	ios::sync_with_stdio(false);
	while (1) {
		cin >> M >> T >> P >> R;
		if (M == 0 && T == 0 && P == 0 && R == 0) break;
		vector<Score> score(T);
		VII pena(T, VI(P, 0));
		rep (i, T) {
			score[i].team = i;
		}
		rep (i, R) {
			int m, t, p, f;
			cin >> m >> t >> p >> f;
			if (f != 0) {
				pena[t - 1][p] += 20;
			} else {
				score[t - 1].count++;
				score[t - 1].time += m + pena[t - 1][p];
			}
		}
		sort(all(score));
		rep (i, score.size()) {
			if (i != 0) {
				cout << (score[i - 1].count == score[i].count && score[i - 1].time == score[i].time? '=' : ',');
			}
			cout << score[i].team + 1;
		}
		cout << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int m,t,p,r;
struct team{
int id;
int ac;
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;
	}
	return 0;
}