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(true){
        int contestTime, teamCount, probremCount, submitCount;
        cin >> contestTime >> teamCount >> probremCount >> submitCount;
        if(contestTime == 0){
            break;
        }
        int teamPoint[teamCount], teamTime[teamCount], teamPenalty[teamCount][probremCount];
        for(int i = 0; i < teamCount; i++){
            teamPoint[i] = teamTime[i] = 0;
            for(int j = 0; j < probremCount; j++){
                teamPenalty[i][j] = 0;
            }
        }
        for(int i = 0; i < submitCount; i++){
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            t--;
            if(j == 0){
                teamPoint[t]++;
                teamTime[t] += m + teamPenalty[t][p] * 20;
            }else{
                teamPenalty[t][p]++;
            }
        }
        int previousIndex = -1;
        int previousPoint = -1;
        int previousTime = -1;
        for(int i = 0; i < teamCount; i++){
            int maxPoint = 0;
            int topTime = contestTime;
            int topIndex = 0;
            for(int j = 0; j < teamCount; j++){
                if(teamPoint[j] > maxPoint){
                    maxPoint = teamPoint[j];
                    topTime = teamTime[j];
                    topIndex = j;
                }else if(teamPoint[j] == maxPoint){
                    if(topTime >= teamTime[j]){
                        topTime = teamTime[j];
                        topIndex = j;
                    }
                }
            }
            if(i != 0 && maxPoint == previousPoint && topTime == previousTime){
                cout << '=' << topIndex + 1;
            }else if(i != 0){
                cout << ',' << topIndex + 1;
            }else{
                cout << topIndex + 1;
            }
            previousIndex = topIndex;
            previousTime = teamTime[topIndex];
            previousPoint = teamPoint[topIndex];
            teamPoint[topIndex] = -1;
            teamTime[topIndex] = contestTime + 1;
            
        }
            cout << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>

using namespace std;

int main() {
    int M, T, P, R;
    while (cin >> M >> T >> P >> R){
        int num_solved[T];
        int num_wrong[T][P];
        int total_time[T];

        memset(num_solved, 0, sizeof(num_solved));
        memset(num_wrong, 0, sizeof(num_wrong));
        memset(total_time, 0, sizeof(total_time));

        for (int i = 0; i < R; i++){
            int m, t, p, j;
            cin >> m >> t >> p >> j; t--; p--;
            if (j == 0){
                num_solved[t]++;
                total_time[t] += num_wrong[t][p] * 20 + m;
            } else {
                num_wrong[t][p]++;
            }
        }

        vector<pair<pair<int, int>, int> > vs; 

        for (int i = 0; i < T; i++){
            vs.push_back(make_pair(make_pair(-num_solved[i], total_time[i]), -i)); 
        }
        sort(vs.begin(), vs.end());

        for (int i = 0; i < T; i++){
            if (i > 0){
                if (vs[i].first == vs[i - 1].first){
                    cout << "=";
                } else {
                    cout << ",";
                }
            }
            cout << -vs[i].second + 1 ;
        }
        cout << endl; 
    }
    return 0;
}

C++: //
//  main.cpp
//  AOJ1187
//
//  Created by aki33524 on 2014/07/07.
//  Copyright (c) 2014年 aki33524. All rights reserved.
//

#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

typedef struct {int m, t, p; bool ac;} Submit;

typedef struct _Team{
    int solved, penalty[10], alltime, id;
    
    bool operator<(const _Team& right) const{
        return (solved < right.solved) || (solved == right.solved && alltime > right.alltime);
    }
    bool operator==(const _Team& right) const{
        return solved == right.solved && alltime == right.alltime;
    }
    
} Team;

int M, T, P, R;

Submit submits[2001];
Team teams[50];

void solve(){
    memset(teams, 0, sizeof(teams));
    for(int t=0; t<T; t++)
        teams[t].id = t+1;
    
    for(int r=0; r<R; r++){
        Submit &submit = submits[r];
        Team &team = teams[submit.t];
        
        if(submit.ac){
            team.solved++;
            team.alltime += team.penalty[submit.p] + submit.m;
        }else{
            team.penalty[submit.p] += 20;
        }
    }
    
    sort(teams, teams+T);
    
    for(int t=T-1; 0<=t; t--){
        Team &team = teams[t];
        if(0<t){
            cout << team.id;
            cout << (team==teams[t-1] ? "=" : ",");
        }else{
            cout << team.id << endl;
        }
    }
}

int main(int argc, const char * argv[])
{
    while(cin>>M>>T>>P>>R, M|T|P|R){
        for(int r=0; r<R; r++){
            Submit &s = submits[r];
            int m, t, p, j;
            cin>>m>>t>>p>>j;
            s.m = m;
            s.t = t-1;
            s.p = p-1;
            s.ac = j==0;
        }
        solve();
    }
    
    return 0;
}