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;

struct Team
{
	vector<bool> is_solve;
	vector<int> WA;
	int team_id, time, solved;
	Team(){}
	Team(int P, int id)
	{
		is_solve = vector<bool>(P, false);
		WA = vector<int>(P, 0);
		team_id = id;
		time = 0;
		solved = 0;
	}
};
bool operator<(const Team &a, const Team &b)
{
	if (a.solved == b.solved)
	{
		if (a.time == b.time)
		{
			return a.team_id > b.team_id;
		}
		return a.time < b.time;
	}
	return a.solved > b.solved;
}
bool operator==(const Team &a, const Team &b)
{
	return a.solved == b.solved && a.time == b.time;
}

void solve()
{
	int M, T, P, R;
	while (cin >> M >> T >> P >> R, M)
	{
		vector<Team> v;
		for (int i = 0; i < T; i++)
		{
			v.push_back(Team(P, i));
		}

		for (int i = 0; i < R; i++)
		{
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--; p--;
			if (j == 0){
				for (int k = 0; k < v.size(); k++)
				{
					if (v[k].team_id == t)
					{
						v[k].is_solve[p] = true;
						v[k].solved++;
						v[k].time += m;
						v[k].time += 20 * v[k].WA[p];
						break;
					}
				}
			}
			else
			{ 
				for (int k = 0; k < v.size(); k++)
				{
					if (v[k].team_id == t)
					{
						v[k].WA[p]++;
						break;
					}
				}
			}
		}

		sort(v.begin(), v.end());
		for (int i = 0; i < v.size(); i++)
		{
			if (i)
			{
				bool flag = (v[i - 1] == v[i]);
				cout << (flag ? "=" : ",");
			}
			cout << v[i].team_id + 1;
		}
		cout << endl;
	}
}

int main()
{
	solve();
	return(0);
}

C++: #include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <string>

using namespace std;

const int MAX_P=10,MAX_T=50,MAX_R=2000;
const int MAX_CASE=100;

struct data{
	int ans;	//??£?§£??°
	int time;	//????????????
	int pena[MAX_P];	//??????i?????????????????£???
	int index;	//???????????????
};

bool comp(const data &a,const data &b){
	if (a.ans!=b.ans)
		return a.ans>b.ans;
	if (a.time!=b.time)
		return a.time<b.time;
	return a.index>b.index;
}

bool same(const data &a,const data &b){
	if (a.ans==b.ans && a.time==b.time){
		return true;
	}
	return false;
}

int A[MAX_CASE],B[MAX_CASE],C[MAX_CASE],D[MAX_CASE];
int ma[MAX_CASE][MAX_R],ta[MAX_CASE][MAX_R],pa[MAX_CASE][MAX_R],ja[MAX_CASE][MAX_R];

data d[MAX_T];

int main(){
	int q=0;
	do{
		int n,t,p,r;
		scanf("%d %d %d %d",A+q,B+q,C+q,D+q);
		for (int i=0;i<D[q];i++){
			scanf("%d %d %d %d",&ma[q][i],&ta[q][i],&pa[q][i],&ja[q][i]);
		}
		q++;
	}while (A[q-1]!=0);
	int N,T,P,R;
	for (int k=0;k<q;k++){
		N=A[k],T=B[k],P=C[k],R=D[k];
		for (int i=0;i<T;i++){
			d[i].ans=d[i].time=0;
			d[i].index=i+1;
			memset(d[i].pena,0,sizeof(d[i].pena));
		}
		for (int i=0;i<R;i++){
			int m,t,p,j;
			m=ma[k][i],t=ta[k][i],p=pa[k][i],j=ja[k][i];
			data &da=d[t-1];
			if (j==0){
				//??£?§£
				da.time+=m+da.pena[p-1];
				da.ans++;
			}
			else{
				//?????£?§£
				da.pena[p-1]+=20;	//??????????????£???
			}
		}
		sort(d,d+T,comp);
		for (int i=0;i<T;i++){
			if (i){
				if (same(d[i],d[i-1])){
					printf("=");
				}
				else{
					printf(",");
				}
			}
			printf("%d",d[i].index);
		}
		printf("\n");
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define all(co) begin(co), end(co)

int main() {
	int m,t,p,r;
while (cin >> m >> t >> p >> r && m) {
	vector<vector<int>> v(t, vector<int>(p));
	rep(i, r) {
		int m, t, p, j; cin >> m >> t >> p >> j;
		t--;
		if (j == 0) {
			if(v[t][p] == 0) v[t][p] = m;
			else v[t][p] = m + -v[t][p] * 20;
		}
		else v[t][p]--;
	}
	map<int, vector<int>> rank;
	rep(i, t) {
		int s = -accumulate(all(v[i]), 0);
		if(rank.count(s)) rank[s].push_back(i + 1);
		else rank.emplace(s, vector<int>{i+1});
	}
	for(auto it = rank.begin(); it != --rank.end(); it++) {
		auto& v = it->second;
		rep(i, v.size() - 1) cout << v.at(i) << '=';
		cout << v.back();
		cout << ',';
	}
	{
		auto it = --rank.end();
		auto& v = it->second;
		rep(i, v.size() - 1) cout << v.at(i) << '=';
		cout << v.back();
	}
	cout << endl;
}
}