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++: #define _USE_MATH_DEFINES 
#include <iomanip> 
#include <cmath>  
#include<iostream>
#include <fstream>
#include<vector>
#include<algorithm>
#include<bitset>
#include<map>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define repi(i,a,b) for(ll i = (ll)(a) ; i < (ll)(b) ; i++)
#define repd(i,a,b) for(ll i = (ll)(a) ; i > (ll)(b) ; i--)
#define rd(x) cin >> x
#define wr(x)  cout << x
#define wrln(x) cout << x << endl

int M, T, P, R;

int main() {
	struct team {
		int number, point, time;
		bool operator<(const team& right) const {
			// ポイントは大きい方が↑、同じなら時間小さい方が↑
			return point == right.point ? time > right.time : point < right.point;
		}
	};
	while (1) {
		cin >> M >> T >> P >> R;
		if (M == 0 && T == 0 && P == 0 && R == 0) break;
		vector<team> teams;
		team ttemp;
		repi(i, 0, T) {
			team t;
			t.number = i, t.point = 0, t.time = 0;
			teams.push_back(t);
		}
		int mi, ti, pi, ji;//経過時間、チーム番号、問題番号、ジャッジの種類
		int timetemps[51][11] = {};//[チーム番号][問題番号]
		repi(i, 0, R) {
			cin >> mi >> ti >> pi >> ji;
			if (ji == 0) {
				//正解
				teams[ti - 1].point++;
				teams[ti - 1].time += (timetemps[ti - 1][pi] + mi);
			}
			else {
				//不正解
				timetemps[ti-1][pi] += 20;
			}
		}
		sort(teams.begin(), teams.end());
		reverse(teams.begin(), teams.end());
		repi(i, 0, teams.size()) {
			if (i > 0) {
				if (teams[i].point == teams[i - 1].point && teams[i].time == teams[i - 1].time) {
					wr("=");
				}
				else {
					wr(",");
				}
			}
			wr(teams[i].number + 1);
		}
		cout << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main ()
{
	int m,t,p,r;
	while(cin>>m>>t>>p>>r)
	{
		if(m==0&&t==0&&p==0&&r==0)break;
		vector<pair<int, int> > a;//score time 
		int num[150];
		int miss[150][20]={};
		for(int i=0;i<150;i++)num[i]=i;
		for(int i= 0;i<60;i++)
		{
			pair<int,int> l;
			l.first=0;
			l.second=0;
			a.push_back(l);
		}
		
		for(int i =0;i<r;i++)
		{
			
			int time,team,prob,stat;
			cin>>time>>team>>prob>>stat;
			team--;
			
			if(stat==0)
			{
				a[team].first++;
				a[team].second+=miss[team][prob]*20+time;
			}
			else
			{
				miss[team][prob]++;
			}
		}
		
		
		bool end=true;
		while(end)
		{
			end = false;
			for(int i=1;i<t;i++)
			{
				if(a[i].first>a[i-1].first)
				{
					swap(a[i],a[i-1]);
					swap(num[i],num[i-1]);
					end = true;
				}
				else if(a[i].first==a[i-1].first&&a[i].second<a[i-1].second)
				{
					swap(a[i],a[i-1]);
					swap(num[i],num[i-1]);
					end= true;
				}
				else if(num[i]>num[i-1]&&a[i].first==a[i-1].first&&a[i].second==a[i-1].second)
				{
					
					swap(a[i],a[i-1]);
					swap(num[i],num[i-1]);
					end=true;
				}
			}
		}
		cout<<num[0]+1;
		for(int i=1;i<t;i++)
		{
			if(a[i]==a[i-1])cout<<"=";
			else cout<<",";
			cout<<num[i]+1;
		}
		cout<<endl;
		
		
	}
	return 0;
}

C++: #include <cstdio>
#include <iostream>

#define MAX_PROBLEM 10
#define MAX_TEAM 50

using namespace std;

struct Team {
	int num;
	int min;
	int point;
	bool prob[MAX_PROBLEM];
	int judge[MAX_PROBLEM];
};

bool lessTeam(const Team &l, const Team &r) {
	if (l.point < r.point) { return false; }
	if (l.point > r.point) { return true; }

	if (l.min < r.min) { return true; }
	if (l.min > r.min) { return false; }

	if (l.num < r.num) { return false; }
	if (l.num > r.num) { return true; }
}

int main(void) {
	for (;;) {
		int M, T, P, R;
		cin >> M >> T >> P >> R;
		if (M == 0 && T == 0 && P == 0 && R == 0) {
			break;
		}

		Team team[MAX_TEAM];
		for (int i = 0; i < T; i++) {
			team[i].num = i + 1;
			team[i].min = 0;
			team[i].point = 0;
			for (int j = 0; j < MAX_PROBLEM; j++) {
				team[i].prob[j] = false;
				team[i].judge[j] = 0;
			}
		}

		for (int i = 0; i < R; i++) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			
			if (j == 0) {
				team[t - 1].min += m;
				team[t - 1].prob[p - 1] = true;
				team[t - 1].point++;
			} else {
				team[t - 1].judge[p - 1]++;
			}
		}

		for (int i = 0; i < T; i++) {
			for (int j = 0; j < P; j++) {
				if (team[i].prob[j]) {
					team[i].min += team[i].judge[j] * 20;
				}
			}
		}

		for (int i = 0; i < T; i++) {
			for (int j = i + 1; j < T; j++) {
				if (lessTeam(team[j], team[i])) {
					Team tmp = team[i];
					team[i] = team[j];
					team[j] = tmp;
				}
			}
		}

		for (int i = 0; i < T - 1; i++) {
			printf("%d", team[i].num);
			if (team[i].point == team[i + 1].point && team[i].min == team[i + 1].min) {
				printf("=");
			} else {
				printf(",");
			}
		}
		printf("%d\n", team[T-1].num);
	}
	return 0;
}