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{
	int score;
	int time;
	int team;
	//各問題の間違えた回数
	vector<int> wrong;
	Team(){
		score = time = team = 0;
		wrong.assign(11,0);
	}

	bool operator==(const Team& rhs) const{
		return score == rhs.score && time == rhs.time;
	}
};


	//　順位の降順でソート
	bool operator<(const Team& lhs, const Team& rhs){
		return lhs.score > rhs.score || (lhs.score == rhs.score && 
			(lhs.time < rhs.time ||
			(lhs.time == rhs.time && lhs.team > rhs.team)));
	}

int main(){
	int M, T, P, R;
	while(cin>>M>>T>>P>>R,M){
		vector<Team> ts(T);
		for(int i=0;i<T;++i) ts[i].team = i+1;
		for(int i=0;i<R;++i){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			Team& tm = ts[t-1];
			if(j == 0){
				tm.score++;
				tm.time += m + tm.wrong[p] * 20;
			}
			else
				tm.wrong[p]++;
		}
		for(int i=0;i<T;++i)
			for(int j=0;j<T;++j)
				if(ts[i] < ts[j])
					swap(ts[i],ts[j]);

		for(int i=0;i+1<T;++i){
			cout << ts[i].team << (ts[i]==ts[i+1]?"=":",");			
		}
		cout << ts[T-1].team << endl;
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

class team{
public:
	int num, ans, time;
	team(int n){
		num = n;
		ans = time = 0;
	}
	bool operator<(const team &t2)const{
		if (ans != t2.ans)
			return ans > t2.ans;
		else if (time != t2.time)
			return time < t2.time;
		else
			return num > t2.num;
	}
};

int main()
{
	int M, T, P, R, m[2001], t[2001], p[2001], r[2001],before;
	while (cin >> M >> T >> P >> R, (M || T || P || R)){
		vector<team> v;
		vector<team>::iterator pv;
		//入力
		for (int i = 0; i < R; i++){
			cin >> m[i] >> t[i] >> p[i] >> r[i];
		}

		//各チームの時間
		for (int i = 1; i <= T; i++){
			team te = team(i);
			for (int j = 0; j < R; j++){
				//正解時間の計算
				if (t[j] == i && r[j] == 0){
					te.time += m[j];
					te.ans++;
					//以前のペナルティを計算
					for (int k = 0; k < j; k++){
						if (t[k] == i && p[k] == p[j]){
							te.time += 20;
						}
					}
				}
			}
			v.push_back(te);
		}

		//ソート
		sort(v.begin(), v.end());
		pv = v.begin();
		before = -1;
		while (pv != v.end()){
			if (before == pv->time)
				cout << "=" << pv->num;
			else {
				if (pv == v.begin())
					cout << pv->num;
				else
					cout << "," << pv->num;
				before = pv->time;
			}
			pv++;
		}
		cout << endl;
		v.~vector();
	}
	return 0;
}

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

using namespace std;

struct team {
	team() {
		for (int i = 0; i < 10; ++i) {
			ac[i] = -1;
			fa[i] = 0;
		}
	}
	int no;
	int ac[10];
	int fa[10];
	
	int na() const {
		int ans = 0;
		for (int i = 0; i < 10; ++i)
			if (ac[i] != -1)
				++ans;
		return ans;
	}
	
	int st() const {
		int ans = 0;
		for (int i = 0; i < 10; ++i)
			if (ac[i] != -1)
				ans += ac[i] + fa[i] * 20;
		return ans;
	}
	
	bool operator==(const team &rh) {
		return this->na() == rh.na() && this->st() == rh.st();
	}
	
	bool operator<(const team &rh) const {
		if (this->na() > rh.na())
			return true;
		else if (this->na() < rh.na())
			return false;
		
		if (this->st() < rh.st())
			return true;
		else if (this->st() > rh.st())
			return false;
		
		return this->no > rh.no;
	}
};

int main()
{
	for (;;) {
		int m, t, p, r;
		scanf("%d %d %d %d", &m, &t, &p, &r);
		if (m == 0 && t == 0 && p == 0 && r == 0)
			break;
			
		team teams[10];
		for (int i = 0; i < t; ++i)
			teams[i].no = i + 1;
		
		for (int i = 0; i < r; ++i) {
			int m, t, p, j;
			scanf("%d %d %d %d", &m, &t, &p, &j);
			
			if (j == 0)
				teams[t - 1].ac[p - 1] = m;
			else if (j == 1)
				teams[t - 1].fa[p - 1] += 1;
		}
		
		sort(teams, teams + t);
		
		for (int i = 0; i < t; ++i) {
			printf("%d", teams[i].no);
			if (i == t - 1)
				printf("\n");
			else if (teams[i] == teams[i + 1])
				printf("=");
			else
				printf(",");
		}
	}
	
	return 0;
}