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 <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int M, T, P, R;
int num[60], sum[60], wa[60][15];

struct Elem {
    int team, solved, tm;
};

bool operator<(const Elem &a, const Elem &b) {
    if(a.solved != b.solved) return a.solved > b.solved;
    if(a.tm != b.tm) return a.tm < b.tm;
    return a.team > b.team;
}

signed main() {
    while(cin >> M >> T >> P >> R, M) {
        memset(num, 0, sizeof(num));
        memset(sum, 0, sizeof(sum));
        memset(wa , 0, sizeof(wa ));

        rep(i,0,R) {
            int m, t, p, j; cin >> m >> t >> p >> j;
            // Accepted
            if(j == 0) {
                num[t]++;
                sum[t] += m + 20 * wa[t][p];
            }
            // WA
            else {
                wa[t][p]++;
            }
        }

        vector<Elem> v;
        repq(i,1,T) v.push_back(Elem{i, num[i], sum[i]});
        sort(v.begin(), v.end());

        pii prev = pii(-1, -1);
        rep(i,0,T) {
            pii t = pii(v[i].solved, v[i].tm);
            // printf("num = %lld, sum = %lld\n", num[i], sum[i]);
            bool p = (t == prev);
            if(i != 0) cout << (p ? "=" : ",");
            printf("%lld", v[i].team);
            prev = t;
        }
        cout << endl;
    }
    return 0;
}

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

struct team{
	int n, c, m, p;
};

bool operator<(const team team1, const team team2){
	bool rep;
	if(team1.c == team2.c){
		rep = (team1.m == team2.m) ? team1.n > team2.n : team1.m < team2.m;
	}else{
		rep = (team1.c > team2.c);
	}
	return rep;
}

int main(){
	int M, T, P, R;
	while( cin >> M >> T >> P >> R, M || T || P || R ){
		vector<team> teams(T);
		for(int i = 0; i < T; i++){
			teams[i].n = i+1;
			teams[i].c = 0;
			teams[i].m = 0;
			teams[i].p = 0;
		}
		for(int i = 0; i < R; i++){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if( j == 0 ){
				teams[t-1].c++;
				teams[t-1].m += (m + 20 * teams[t-1].p);
				teams[t-1].p = 0;
			}else{
				teams[t-1].p++;
			}
		}
		sort(teams.begin(), teams.end());
		cout << teams[0].n;
		for(int i = 1; i < T; i++){
			if( teams[i].c == teams[i-1].c && teams[i].m == teams[i-1].m ) cout << "=";
			else cout << ",";
			cout << teams[i].n;
		}
		cout << endl;
	}
}

C++: #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <map>
#include <set>
#include <list>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <iomanip>

#define SIZE 101
#define INF 100000000

using namespace std;


typedef pair<int, int> Pa;


int tim[100][100]; // t p time
bool pra[100][100];

int main()
{
	int M, T, P, R;
	
	pair<Pa, int> pa;

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

		for (int i = 0; i <= T; i++) {
			for (int j = 0; j <= P; j++) {
				tim[i][j] = 0; 
				pra[i][j] = false;
			}
		}
		vector<pair<Pa, int>> v(T + 1);

		for (int i = 0; i <= T; i++) {
			v[i].second = i;
		}

		for (int i = 0; i < R; i++) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if (j == 0) {
				v[t].first.first++;
				v[t].first.second += - m + tim[t][p];
			} else {
				tim[t][p] -= 20;
			}
		}

		sort(v.begin(),v.end());
		for (int i = T; i >= 1; i--) {
			//cout << v[i].first.first << " " << v[i].first.second << " " << v[i].second << endl;
			cout << v[i].second;
			if (i == 1) break;
			if (v[i].first.first == v[i - 1].first.first && v[i].first.second == v[i - 1].first.second)cout << "=";
			else cout << ",";
		}
		cout << endl;
		
	}
	

	return (0);
}