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>
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<R;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]=false;
		}

		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(CO[j]>CP[tnow]||(CP[j==CP[tnow]&&TT[j]<=TT[tnow])){
						tnow=j;
					}
				}
			}
			
			if(tpre!=-1){
				if(CP[tnow]==CP[tpre]&&TT[tpre]<=TT[tnow]){
					cout<<'=';
				}
				else{
					cout<<'.';
				}
			}
			cout<<tnow+1;
		
			flg[tnow]=true;
			tpre=tnow;
		}
		cout<<endl;
	}
	
	return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std; 

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;

typedef pair<int, int> Pii;
typedef map<int, int> Mii;
typedef vector<int> Vi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;

struct sol{
	int n, s, ti, wr[20];
	sol(){};
	bool operator<(const sol& rhs) {
		if (s == rhs.s) 
			if (ti == rhs.ti) {
				return n > rhs.n;
			} else 
				return  ti < rhs.ti;
		return s > rhs.s;
	}
};
sol x[55];

int main()
{
	while (1) {
		int M, T, P, R;
		cin >> M >> T >> P >> R;
		if (M==0) break;
		memset(x, 0, sizeof(x));
		rep(i,0,T) x[i].n = i+1;

		rep(i,0,R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			if (j==0) {
				x[t].s++;
				x[t].ti += m + x[t].wr[p];
			}
			else {
				x[t].wr[p] += 20;
			}
		}
		sort(x, x+T);
		cout << x[0].n;
		rep(i,1,T) {
			if (x[i].s == x[i-1].s && x[i].ti == x[i-1].ti) cout << "=";
			else cout << ",";
			cout << x[i].n;
		}
		cout << endl;
	}

	return 0;
}

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

typedef pair<int, int> P;

struct Team {
    int number;
    int m = 0, p = 0;
    vector<P> question;
};

typedef vector<Team> AdjList;

AdjList team;

bool comp_solved(const Team& e1, const Team& e2){
    return e1.p > e2.p;
}
bool comp_m(const Team& e1, const Team& e2){
    return e1.m < e2.m;
}
bool comp_n(const Team& e1, const Team& e2){
    return e1.number < e2.number;
}

int main(void){
    int M, T, P1, R;
    int m[2001], t[2001], p[2001], j[2001];
    while(cin >> M >> T >> P1 >> R){
    	if(M == 0 && T == 0 && P1 == 0 && R == 0){
    		break;
    	}
        team = AdjList(T);
        int a[100][100];
        for(int i=0;i<R;i++){
            cin >> m[i] >> t[i] >> p[i] >> j[i];
            team[t[i]-1].number = t[i];
            if(j[i] == 0){
                team[t[i]-1].p++;
                team[t[i]-1].m += m[i];
                if(!team[t[i]-1].question.empty()){
                    int j=0;
                    while(!team[t[i]-1].question.empty()){
                        P ans = team[t[i]-1].question[j];
                        if(ans.first == p[i]){
                            team[t[i]-1].m += ans.second;
                        }
                        j++;
                    }
                }
            }else{
                team[t[i]-1].question.push_back(P(p[i], m[i]));
            }
        }
        sort(team.begin(), team.end(), comp_solved);
        int solvedC = team[0].p;
        int cntF=0,cntE=0;
        for(int j=0;j<P1;j++){
            for(int i=1;i<T;i++){
                if( team[i].p == solvedC){
                    cntE++;
                }
            }
            sort(team.begin()+cntF,team.begin()+cntE,comp_m);
            cntF = cntE+1;
            cntE = cntF;
            if(team.begin()+cntF > team.end()){
                break;
            }
        }
        // for(int i=0;i<2;i++){
        //     cout << team[i].number << endl;
        // }
        
    }
    return 0;
}