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<string>
#include<vector>

using namespace std;

struct teme {
	int num;
	int caPro;
	int sumtime;
	int pro[11];
};

void temeset(teme* t, int yoso) {
	for (int i = 1; i <= yoso; i++) {
		t[i].num = i;
		t[i].caPro = 0;
		t[i].sumtime = 0;
		for (int j = 1; j <= 10; j++) {
			t[i].pro[j] = 0;
		}
	}
}

int comp(const void*  A,const void* B) {
	const teme* a = (const teme*)A;
	const teme* b = (const teme*)B;

	if (b->caPro == a->caPro)
	{
		if (b->sumtime == a->sumtime) {
			return b->num - a->num;
		}
		return a->sumtime - b->sumtime;
	}
	return b->caPro - a->caPro;
}

int main() {
	int w, t, p, r;
	vector<string>v;
	while (cin >> w >> t >> p >> r, w || t || p || r) {
		teme te[51];
		temeset(te, t);
		for (int i = 0; i < r; i++) {
			int mk, tk, pk, jk;
			cin >> mk >> tk >> pk >> jk;
			if (jk == 0) {
				te[tk].caPro++;
				te[tk].sumtime += mk + te[tk].pro[pk];
			}
			else {
				te[tk].pro[pk] += 20;
			}
		}
		qsort(te+1, t, sizeof(teme), comp);
		string s = "";
		for (int i = 1; i <= t; i++) {
			//cout << te[i].num << "???:" << te[i].caPro << " " << te[i].sumtime << endl;
			s += to_string(te[i].num);
			if (i != t) {
				if (te[i].caPro == te[i + 1].caPro && te[i].sumtime == te[i + 1].sumtime) {
					s += "=";
				}
				else {
					s += ",";
				}
			}
		}
		cout << s << endl;
	}

	/*for (int i = 0; i < v.size(); i++) {
		cout << v[i] << endl;
	}*/
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>

using namespace std;

struct Info{
	Info(){
		team_id = num_ans = sum_time = 0;
	}
	int team_id,num_ans,sum_time;
};

void func(int TOTAL_TIME,int num_team,int num_problem,int num_log){
	Info info[num_team+1];
	int penaTable [num_team+1][num_problem+1];
	for(int i = 1; i <= num_team; i++){
		for(int k = 1; k <= num_problem; k++)penaTable[i][k] = 0;
	}

	for(int i = 1; i <= num_team; i++){
		info[i].team_id = i;
	}

	int m,t,p,j;

	for(int i = 0; i < num_log; i++){
		scanf("%d %d %d %d",&m,&t,&p,&j);

		if(j == 0){
			info[t].num_ans += 1;
			info[t].sum_time += (m + penaTable[t][p]);
		}else{
			penaTable[t][p] += 20;
		}
	}

	for(int i = 2; i <= num_team; i++){
		for(int k = num_team; k >= i; k--){
			if(info[k].num_ans > info[k-1].num_ans)swap(info[k],info[k-1]);
			else if(info[k].num_ans == info[k-1].num_ans && info[k].sum_time < info[k-1].sum_time)swap(info[k],info[k-1]);
			else if(info[k].num_ans == info[k-1].num_ans && info[k].sum_time == info[k-1].sum_time &&
					info[k].team_id > info[k-1].team_id)swap(info[k],info[k-1]);
		}
	}

	printf("%d",info[1].team_id);

	for(int i = 2; i <= num_team; i++){
		if((info[i].num_ans < info[i-1].num_ans) || (info[i].num_ans == info[i-1].num_ans && info[i].sum_time > info[i-1].sum_time)){
			printf(",%d",info[i].team_id);
		}else{
			printf("=%d",info[i].team_id);
		}
	}
	printf("\n");

}


int main(){

	int M,T,P,R;

	while(true){
		scanf("%d %d %d %d",&M,&T,&P,&R);
		if(M == 0 && T == 0 && P == 0 && R == 0)break;

		func(M,T,P,R);

	}

	return 0;
}

C++: #include <iostream>
#define max_T 50
#define max_P 10

using namespace std;

int cmp(const void *,const void *);

int main(void){
	for(int M,T,P,R;cin >> M >> T >> P >> R,M;){
		int solve[max_T][3]={0};
		for(int i=0;i<T;i++)
			solve[i][0]=i+1;

		int p_min[max_T][max_P]={0};
		for(int m,t,p,j,i=0;i<R&&cin >> m >> t >> p >> j;i++){
			p_min[t-1][p-1]+=j?20:m;
			if(!j){
				solve[t-1][1]++;
				solve[t-1][2]+=p_min[t-1][p-1];
			}
		}

		qsort((void *)solve,T,sizeof(solve[0]),cmp);

		for(int i=0;i<T;i++)
			cout << solve[i][0] << (i<T-1?solve[i][1]!=solve[i+1][1]||solve[i][2]!=solve[i+1][2]?",":"=":"");
		cout << endl;
	}
}

int cmp(const void *a,const void *b){
	int *s[2]={(int *)a,(int *)b},ret;

	if(s[0][1]>s[1][1])
		ret=-1;
	else if(s[0][1]<s[1][1])
		ret=1;
	else
		if(s[0][2]<s[1][2])
			ret=-1;
		else if(s[0][2]>s[1][2])
			ret=1;
		else
			ret=s[0][0]>s[1][0]?-1:1;

	return ret;
}