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 <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));
            cerr << "FLAG1" << endl;
            for (int i = 0; i < rn; ++i) {
                last_solved[t[i] - 1][p[i] - 1] = (j[i] == 0? m[i]: -1);
                ++answer[t[i]][p[i]];
            }
            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] = max(score[ti][1], last_solved[ti][pi]);
                    }
                }
            }
            cerr << "FLAG2" << endl;
            sort(score.begin(), score.end());
            retval = i2s(-score[0][2]);
            cerr << "FLAG3" << endl;
            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]);
            }
            cerr << "FLAG4" << endl;
            cerr << retval << endl;
            cerr << "FLAG4b" << endl;
            return retval;
        }
};

int main() {
    Solver s;
    while (true) {
        string answer;
        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];
        }
        cerr << "FLAG0" << endl;
        answer = s.solve();
        cerr << "FLAG5a" << endl;
        cout << answer << endl;
        cerr << "FLAG5" << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;

pair<int,int> bd[50][10]; // (間違い数, 経過時間)

void clear() {
    for (int i=0; i<50; ++i) {
        for (int j=0; j<10; ++j) {
            bd[i][j] = make_pair(0, -1);
        }
    }
}

int main() {
    int M, T, P, R;
    while (cin >> M >> T >> P >> R, M) {
        clear();
        for (int i=0; i<R; ++i) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            if (j) bd[t-1][p-1].first ++;
            else bd[t-1][p-1].second = m;
        }
        vector<tuple<int,int,int>> scores(T); // (正解数, -所要時間, チーム番号)
        for (int i=0; i<T; ++i) {
            scores[i] = make_tuple(0, 0, i+1);
            for (int j=0; j<P; ++j) {
                if (bd[i][j].second < 0) continue;
                get<1>(scores[i]) -= bd[i][j].second + bd[i][j].first * 20;;
                get<0>(scores[i]) ++;
            }
        }
        sort(scores.rbegin(), scores.rend());

        for (int i=0; i<T; ++i) {
            if (i == 0) {
                cout << get<2>(scores[i]);
            } else {
                bool tie = get<0>(scores[i-1]) == get<0>(scores[i]) && get<1>(scores[i-1]) == get<1>(scores[i]);
                cout << (tie ? "=" : ",") << get<2>(scores[i]);
            }
        }
        cout << endl;
    }
    return 0;
}

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

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

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

        int CP[50],TT[50],PT[50][10];
        for(int i=0;i<T;i++){
            CP[i]=TT[i]=0;
            for(int j=0;j<P;j++){
                PT[i][j] = 0;
            }
        }

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

            if(j==0){
                CP[t-1]++;
                TT[t-1]+=(m+PT[t-1][p-1]);
            }
            else{
                PT[t-1][p-1]+=20;
            }
        }

        int tnow,tpre=-1;
        bool flg[50];
        for(int i=0;i<T;i++)
            flg[i]=0;

        for(int i=0;i<T;i++){
            tnow=-1;
            for(int j=0;j<T;j++){
                if(flg[j]){
                    continue;
                }

                if(tnow==-1){
                    tnow=j;
                }
                else{
                    if(CP[j]>CP[tnow]||(CP[j]==CP[tnow]&&TT[j]<=TT[tnow])){
                        tnow=j;
                    }
                }
            }

            if(tpre!=-1){
                if(CP[tnow]==CP[tpre]&&TT[tnow]==TT[tpre]){
                    cout << '=';
                }
                else{
                    cout << ',';
                }
            }
            cout<<tnow+1;

            flg[tnow]=1;
            tpre=tnow;
        }
        cout<<endl;
    }

    return 0;
}