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 <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

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

struct Team{
	int no;
	int ac_n;
	int ac_t;
	int times[11];

	bool operator <(const Team& t)const{
		if(ac_n == t.ac_n){
			if(ac_t == t.ac_t){
				return no < t.no;
			}
			return ac_t > t.ac_t;
		}
		return ac_n < t.ac_n;
	}

	bool operator ==(const Team& t)const{
		return ac_n == t.ac_n && ac_t == t.ac_t;
	}
};

int main() {
	int contest_time, team_n, progrom_n, submit_n;
	while(cin >> contest_time >> team_n >> progrom_n >> submit_n, contest_time|team_n|progrom_n|submit_n){
		vector<Team> team(team_n);
		REP(i, team_n) team[i].no = i+1;
		REP(i, submit_n){
			int time, team_no, progrom_no, judge;
			cin >> time >> team_no >> progrom_no >> judge;
			team_no--;
			if(judge == 0){
				team[team_no].ac_n++;
				team[team_no].ac_t += time;
				team[team_no].ac_t += team[team_no].times[progrom_no]*20;
			}else{
				team[team_no].times[progrom_no]++;
			}
		}

		RSORT(team);

		cout << team[0].no;
		FOR(i, 1, team_n){
			cout << (team[i] == team[i-1] ? '=' : ',') << team[i].no;
		}
		cout << endl;
	}

}

C++: #include<iostream>
#include<vector>
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<int> teamID(T);
		for (int i = 0; i < T; i++)
		{
			teamID[i] = i;
		}
		int wrong[50][10];
		for (int i = 0; i < T; i++)
		{
			for (int j = 0; j < P; j++)
			{
				wrong[i][j] = 0;
			}
		}
		vector<int> correct(T);
		vector<int> time(T);


		for (int i = 0; i < R; i++)
		{
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			p--;
			if (j == 0)
			{
				correct.at(t)++;
				time.at(t) += m + wrong[t][p] * 20;
			}
			else
			{
				wrong[t][p]++;
			}
		}

		for (int i = 0; i < T - 1; i++)
		{
			for (int j = i + 1; j < T; j++)
			{
				if (correct.at(teamID[i]) < correct.at(teamID[j])
					|| (correct.at(teamID[i]) == correct.at(teamID[j]) && time.at(teamID[i]) > time.at(teamID[j]))
					|| (correct.at(teamID[i]) == correct.at(teamID[j]) && time.at(teamID[i]) == time.at(teamID[j]) && teamID[i] < teamID[j]))
				{
					int tmp = teamID[i];
					teamID[i] = teamID[j];
					teamID[j] = tmp;
				}
			}
		}

		for (int i = 0; i < T; i++)
		{
			if (i > 0 && correct.at(teamID[i]) == correct.at(teamID[i - 1]) && time.at(teamID[i]) == time.at(teamID[i - 1]))
			{
				cout << "=";
			}

			cout << (teamID[i] + 1);

			if (i < T - 1 && 
				!(correct.at(teamID[i]) == correct.at(teamID[i + 1]) && time.at(teamID[i]) == time.at(teamID[i + 1])))
			{
				cout << ",";
			}
		}

		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;
}