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 tid, ac, penalty;
	Team() { tid = -1, ac = 0, penalty = 0; }
};
bool operator >(const Team& t1, const Team& t2) {
	if (t1.ac == t2.ac) {
		if (t1.penalty == t2.penalty) return t1.tid > t2.tid;
		else return t1.penalty < t2.penalty;
	}
	else return t1.ac > t2.ac;
}
bool operator ==(const Team& t1, const Team& t2) {
	return t1.ac == t2.ac && t1.penalty == t2.penalty;
}

int main() {
	int M, T, P, R;
	while ( cin >> M >> T >> P >> R, M || T || P || R ) {
		int wa[10][50] = {0};
		int ac[10][50] = {0};
		vector<Team> tdt(T);
		for (int i = 0; i < T; ++i) {
			tdt[i].tid = i+1;
			tdt[i].ac = 0;
			tdt[i].penalty = 0;
		}
		for (int i = 0; i < R; ++i) {
			int m, t, p, j; cin >> m >> t >> p >> j;
			--t, --p;
			if (j == 0) {
				if (ac[p][t] == 0) {
					++ac[p][t];
					++tdt[t].ac;
					tdt[t].penalty += m + 20 * wa[p][t];
				}
			}
			else {
				++wa[p][t];
			}
		}
		sort( tdt.begin(), tdt.end(), greater<Team>() );
		for (int i = 0; i < tdt.size(); ++i) {
			if (i) {
				if (tdt[i] == tdt[i-1]) cout << "=";
				else cout << ",";
			}
			cout << tdt[i].tid;
		}
		cout << endl;
	}
}

C++: #include <cstring>
#include <iostream>
#include <algorithm>
#include <utility>

using namespace std;
typedef pair<int, int> PII;

int WA[10][50];

int main()
{
  int M, T, P, R;
  while (cin>>M>>T>>P>>R, M||T||P||R) {
    memset(WA, 0, sizeof(WA));
    vector<pair<PII, int>> score(T);
    for (int i=0; i<T; i++) {
      score[i].second = -(i+1);
    }

    for (int r=0; r<R; r++) {
      int m, t, p, j;
      cin>>m>>t>>p>>j;
      t--, p--;

      if (!j) {
        //cout << "Team = " << t << ", AC = " << score[t].first.first << endl;

        // AC
        score[t].first.first--;
        score[t].first.second += m + 20*WA[p][t];
      } else {
        // WA 
        WA[p][t]++;
      }
    }

    sort(score.begin(), score.end());
    for (int i=0; i<score.size(); i++) {
      if (i>0) {
        if (score[i].first.first == score[i-1].first.first && score[i].first.second == score[i-1].first.second) cout << "=";
        else cout << ",";
      }
      cout << -score[i].second;
    }
    cout << endl;
  } 
}

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 <iostream>
#include <sstream>
#include <fstream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
using namespace std;

struct score {
	long teamNum;
	long accepted;
	long time;
	vector<long> miss;
	bool operator==(score s) const {
		return this->accepted == s.accepted && this->time == s.time;
	};
	bool operator<(score s) const {
		return this->accepted != s.accepted ? this->accepted > s.accepted : (this->time != s.time ? this->time < s.time : this->teamNum > s.teamNum);
	};
};

int main() {
	while(1){
		int M, T, P, R;
		cin >> M >> T >> P >> R;
		
		if(!M && !T && !P && !R) break;
		
		score *sc = new score[1+T];
		for(int i = 1; i <= T; i++){
			sc[i].teamNum = i;
			sc[i].accepted = sc[i].time = 0;
		}
		for(int i = 0; i < R; i++){
			int m, t, p, r;
			cin >> m >> t >> p >> r;
			
			if(r){
				sc[t].miss.push_back(p);
			}else{
				sc[t].accepted++;
				sc[t].time += m + 20 * count(sc[t].miss.begin(), sc[t].miss.end(), p);
			}
		}
		
		sort(&sc[1], &sc[1+T]);
		for(int i = 1; i <= T; i++){
			cout << sc[i].teamNum << (i==T ? '\n' : (sc[i]==sc[i+1] ? '=' : ','));
		}
	}
	return 0;
}