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<string>
#include<algorithm>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
using namespace std;
typedef long long ll;
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
Def inf = sizeof(Def) == sizeof(long long) ?  2e18:1e9+10;
int main(){
	int T,te,pr,n;
	while(cin>>T>>te>>pr>>n,T){
		vvi wa(te,vi(pr));
		vector<pair<int,pii> >out(te);//team mis pr team
		rep(i,te)out[i].second.second=i;
		rep(i,n){
			int t,e,p,j;
			cin>>t>>e>>p>>j;
			if(j){
				wa[e-1][p-1]++;
			}else{
				out[e-1].second.first++;
				out[e-1].first+=20*wa[e-1][p-1]+t;
			}
		}
		sort(all(out),[](pair<int,pii>a,pair<int,pii>b){
			return a.second.first!=b.second.first?a.second.first>b.second.first:(a.first!=b.first?a.first<b.first:a.second.second>b.second.second);
		});
		rep(i,te){
			if(i){
				if(out[i-1].first-out[i].first==0&&out[i-1].second.first-out[i].second.first==0)cout<<"=";else cout<<",";
			}
			cout<<out[i].second.second+1;
			if(i==te-1)cout<<endl;
			
		}
	}
}

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 <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <algorithm>
#include <utility>
#include <iomanip>

#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

typedef pair<int, int> P;

const int INF = 1e15;
const int MOD = 1e9+7;

bool comp(tuple<int, int, int>& x, tuple<int, int, int>& y){
    int x_i = get<0>(x);
    int y_i = get<0>(y);
    int x_a = get<1>(x);
    int y_a = get<1>(y);
    int x_t = get<2>(x);
    int y_t = get<2>(y);

    if(x_a != y_a){
        return x_a > y_a;
    }

    if(x_t != y_t){
        return x_t < y_t;
    }

    return x_i > y_i;
}

signed main(){
    while(true){
        int M, T, P, R;
        cin >> M >> T >> P >> R;

        if(M == 0 && T == 0 && P == 0 && R == 0){
            break;
        }

        vector<vector<int>> res(T+1, vector<int>(P+1));
        vector<vector<bool>> ac(T+1, vector<bool>(P+1, false));
        vector<int> time(T+1);

        rep(i, R){
            int m, t, p, j;
            cin >> m >> t >> p >> j;

            if(j == 0){
                ac[t][p] = true;
                time[t] = m;
            }
            res[t][p]++;
        }

        vector<tuple<int, int, int>> rank;
        for(int i = 1; i <= T; i++){
            int pena = 0;
            int AC = 0;
            for(int j = 1; j <= P; j++){
                if(ac[i][j]){
                    pena += res[i][j];
                    AC++;
                }
            }
            pena *= 20;

            rank.emplace_back(i, AC, time[i] + pena);
        }
        sort(rank.begin(), rank.end(), comp);

        rep(i, T-1){
            int r = get<0>(rank[i]);
            int x_a = get<1>(rank[i]);
            int y_a = get<1>(rank[i+1]);
            int x_t = get<2>(rank[i]);
            int y_t = get<2>(rank[i+1]);

            if(x_a != y_a || x_t != y_t){
                cout << r << ",";
            }else{
                cout << r << "=";
            }
        }
        cout << get<0>(rank[T-1]) << endl;

    }

    return 0;
}