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 += ",";
				}
			}
		}
		v.push_back(s);
	}

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

C++: #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

int ac[55] = {0};
int ac2[55][12] = {0};
int wa[55][12] = {0};
int ti[55] = {0};

bool func(int a, int b) {
	a--;
	b--;

	if(ac[a] > ac[b]) return true;
	else if(ac[a] < ac[b]) return false;
	else {
		if(ti[a] < ti[b]) return true;
		else if(ti[a] > ti[b]) return false;
		else {
			if(a > b) return true;
			else return false;
		}
	}
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	while(true) {

		int M,T,P,R;
		cin >> M >> T >> P >> R;
		if(!(M || T || P || R)) break;

		vi rank(T);
		rep(i,0,T) {
			rank[i] = i+1;
			ac[i] = 0;
			ti[i] = 0;
			rep(j,0,P) {
				ac2[i][j] = 0;
				wa[i][j] = 0;
			}
		}

		rep(i,0,R) {
			int m,t,p,j;
			cin >> m >> t >> p >> j;
			if(j == 0) {
				ac[t-1]++;
				ac2[t-1][p-1] = 1;
				ti[t-1] = m;
				rep(j,0,P) if(ac2[t-1][j] == 1) ti[t-1] += wa[t-1][j] * 20;
			}
			else wa[t-1][p-1]++;
		}

		sort(rank.begin(), rank.end(), func);

		rep(i,0,rank.size()-1) {
			cout << rank[i];
			if(ac[rank[i]-1] > ac[rank[i+1]-1]) cout << ',';
			else if(ti[rank[i]-1] < ti[rank[i+1]-1]) cout << ',';
			else cout << '=';
		}
		cout << rank[rank.size()-1] <<endl;
	}


	return 0;
}

C++: #include <iostream>
#include <vector>
#include <sstream>
#include <string>
#include <algorithm>

using namespace std;

class Solver {
typedef vector<int> V;
typedef vector<V> VV;
    private:
        string i2s(int n) {
            stringstream ss;
            ss << n;
            return ss.str();
        }
    public:
        int mn, tn, pn, rn;
        int m[2000], t[2000], p[2000], j[2000];
        string solve() {
            string retval;
            VV last_solved(tn, V(pn, -1));
            VV answer(tn, V(pn, 0));
            VV score(tn, V(3, 0));
            for (int i = 0; i < rn; ++i) {
                last_solved[t[i] - 1][p[i] - 1] = (j[i] == 0? m[i]: -1);
                ++answer[t[i] - 1][p[i] - 1];
            }
            for (int ti = 0; ti < tn; ++ti) {
                score[ti][2] = -ti - 1;
                for (int pi = 0; pi < pn; ++pi) {
                    if (last_solved[ti][pi] >= 0) {
                        --score[ti][0];
                        score[ti][1] += last_solved[ti][pi] + 20 * (answer[ti][pi] - 1);
                    }
                }
            }
            sort(score.begin(), score.end());
            retval = i2s(-score[0][2]);
            for (int i = 1; i < tn; ++i) {
                if (score[i][0] == score[i - 1][0] && score[i][1] == score[i - 1][1]) {
                    retval += "=";
                } else {
                    retval += ",";
                }
                retval += i2s(-score[i][2]);
            }
            return retval;
        }
};

int main() {
    while (true) {
        Solver s;
        cin >> s.mn >> s.tn >> s.pn >> s.rn;
        if (s.mn == 0) {
            return 0;
        }
        for (int i = 0; i < s.rn; ++i) {
            cin >> s.m[i] >> s.t[i] >> s.p[i] >> s.j[i];
        }
        string answer = s.solve();
        cout << answer << endl;
    }
}