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 <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <functional>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef pair<P,int> PP;
int main(){
	while(true){
		int m,t,p,r;
		scanf("%d%d%d%d",&m,&t,&p,&r);
		if(m==0) break;
		int tim[50][10]={},wa[50][10]={};
		rep(i,50) rep(j,10) tim[i][j]=-1;
		rep(i,r){
			int mm,tt,pp,jj;
			scanf("%d%d%d%d",&mm,&tt,&pp,&jj);
			tt--,pp--;
			if(jj==0) tim[tt][pp]=mm+wa[tt][pp]*20;
			else wa[tt][pp]++;
		}
		int pen[50]={},acp[50]={};
		rep(i,t) rep(j,p){
			if(tim[i][j]==-1) continue;
			acp[i]++;
			pen[i]+=tim[i][j];
		}
		vector<PP> vc;
		rep(i,t) vc.push_back(PP(P(acp[i],-pen[i]),i+1));
		sort(vc.begin(),vc.end(),greater<PP>());
		rep(i,t){
			if(i==0){
				printf("%d",vc[i].second);
				continue;
			}
			if(vc[i].first==vc[i-1].first) printf("=%d",vc[i].second);
			else printf(",%d",vc[i].second);
//			cout << vc[i].second << " acp " << vc[i].first.first << " pen " << vc[i].first.second << endl;
		}
		printf("\n");
	}
	return 0;
}

C++: #include<iostream>
//#include<fstream>
#include<vector>

using namespace std;

int main(){
	
	ifstream fin;
	fin.open("input.txt");

	int M, T, P, R;//input
	int m, t, p, j;//input

	int time[50];	//経過時間
	int solve[50];	//正解数
	int miss[50][10];	//間違えた数
	int count;
	vector<int> v,s;//解けた問題数ごとに...
	
	while(true){
		for (int i = 0; i < 50; i++){//初期化
			for (int k = 0; k < 10; k++)miss[i][k] = 0;
			time[i] = solve[i] = 0;
		}
		M = T = P = R = m = t = p = j = 0;

		cin >> M >> T >> P >> R;
		if (M == 0)break;

		while (R > 0){//結果計算
			R--;
			cin >> m >> t >> p >> j;
			t--;
			if (j == 0){
				time[t] += m;
				time[t] += miss[t][p] * 20;
				solve[t]++;
			}
			else miss[t][p]++;
		}
		
		for (int i = 0; i < T; i++){
			cout << "チーム" << i+1 << endl << " 経過時間：" << time[i] << " 回答数：" << solve[i];
			cout << endl;
		}
		

		//以下ソート
		count = 0;//初期化
		for (int i = 0; i < T; i++)if (count < solve[i])count = solve[i];

		while (count >= 0){
			for (int i = 0; i < T; i++)if (count == solve[i]){
				v.push_back(i);//countだけ解けたチームを記憶
				s.push_back(time[i]);//解けたチームの時間を記憶
			}

			//バブルソート
			if (s.size() > 1){
				for (int i = 0; i < (int)v.size() - 1; i++)
					for (int k = (int)v.size() - 1; k > i; k--){
						if (s[k] > s[k - 1]){
							int tmp = s[k];
							int temp = v[k];

							s[k] = s[k - 1];
							v[k] = v[k - 1];
							
							s[k - 1] = tmp;
							v[k - 1] = temp;
						}
					}
			}
			if (v.size() > 1){
				for (int i = 0; i < (int)v.size() - 1; i++)
					for (int k = (int)v.size() - 1; k > i; k--)
						if (s[k] == s[k - 1] && v[k] < v[k - 1]){
							int tmp = v[k];
							v[k] = v[k - 1];
							v[k - 1] = tmp;
						}
			}
			//ソート終了

			//output
			while (v.size() > 2){
				if (s[v.size() - 1] == s[v.size() - 2]/* || s[v.size()] == s[v.size() - 1]*/)
					cout << v.back() + 1 << '=';
				else cout << v.back() + 1 << ",";
				v.pop_back();
			}
			if (v.size() == 2){//最後の二つだけ例外処理

				if (s[1] == s[0])
					 cout << v.back()+1 << "=";
				else cout << v.back()+1 << ',';
					v.pop_back();
					cout << v.back()+1;
					if (s[v.size()-1] != 0)cout << ',';
					v.pop_back();
			}
			if (v.size() == 1){
				cout << v.back()+1 << ',';
				v.pop_back();
			}
			v.clear();
			s.clear();
			count--;
		}
		cout << endl;
	}
	return 0;
}

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

#define FOR(i,j,k) for(int i = j; i < k; ++i)
#define reps(i,j,k) FOR(i,j,k)
#define rep(i,j) reps(i,0,j)

class team{ 
public:
	int id;
	int solved;
	int score;
	vector < int > problem;
	team(){}
	team(int id, int solved, int score, vector<int> problem) {
		this->id = id;
		this->solved = solved;
		this->score = score;
		this->problem = problem;
	}

	bool operator<(const team &a)const{
		return solved == a.solved ? score == a.score ? id < a.id : score > a.score : solved < a.solved;
	}
};

int main(){
	while(true){
		int M,T,P,R;
		scanf("%d%d%d%d",&M,&T,&P,&R);
		if(M ==0 && T == 0 && P == 0 && R == 0){
			break;
		}
	
		vector<team> teams;
		vector<int> clr(10);
		rep(i,T) {
			teams.emplace_back(team(i+1,0,0,clr));
		} 

		rep(i,R){
			int m,t,p,j;
			scanf("%d%d%d%d",&m,&t,&p,&j);
			--t;--p;
			if(j == 0) {
				teams[t].solved++;
				teams[t].score += m + 20*teams[t].problem[p];
				teams[t].problem[p] = -1;
			}
			else {
				teams[t].problem[p]++;
			}
		}

		sort(teams.rbegin(), teams.rend());
		
		cout << teams[0].id;
		
		reps(i,1,T) {
			if(teams[i].solved < teams[i-1].solved){
				cout << "," << teams[i].id ;
			}
			else if(teams[i].score != teams[i-1].score) {
				cout << "," << teams[i].id;
			}
			else{
				cout << "=" << teams[i].id;
			}
		}

		cout << endl;
	}
	return 0;
}