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;

const int INF=50000000;

int data[51][12];

int main(){
	int M,T,P,R;
	while(cin>>M>>T>>P>>R && M){
		fill((int*)data,(int*)(data+12),0);
		for(int i=0;i<R;i++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			if(j==0){
				data[t][0]++;
				data[t][11]+=m+data[t][p]*20;
			}
			else data[t][p]++;
		}
		int prev[2]={INF,0};
		for(int i=0;i<T;i++){
			int ans=0;
			int now[2]={0,INF};
			for(int j=T;j>=0;j--){
				if(data[j][0]>now[0]){
					now[0]=data[j][0];
					now[1]=data[j][11];
					ans=j;
				}
				else if(data[j][0]==now[0] && data[j][11]<now[1]){
					now[1]=data[j][11];
					ans=j;
				}
			}
			if(i){
				if(memcmp(now,prev,sizeof(now))==0)cout<<"=";
				else cout<<",";
			}
			cout<<ans;
			memcpy(prev,now,sizeof(now));
			data[ans][0]=-1;
		}
		cout<<endl;
	}
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<cstdlib>
#include<sstream>
#include<queue>
#include<cmath>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#define INF 2147483647
#define lli long long int

using namespace std;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;

class Team{

	public:
		int id = 0;
		int solve = 0;
		int time = 0;
		int rank = 0;	
		vector<int> check; 
		void set(int P,int id){
			this->id = id;
			for (int i = 0; i < P; i++){
				check.push_back(0);
			}
		}
};


bool compare(Team maxT, Team G){
	if (maxT.solve < G.solve){
		return true;
	}else if (maxT.solve > G.solve){
		return false;
	}else{
		if (maxT.time > G.time){
			return true;	
		}else if(maxT.time < G.time){
			return false;
		}else{
			if (maxT.id < G.id){
				return true;
			}else{
				return false;
			}
		}
	}
}

void result_sort(vector<Team> &Group){
	int maxj = 0;
	Team maxT;
	for (int i = 0; i < Group.size(); i++){
		maxj = i;
		maxT.id = INF;
		maxT.time = INF;
		maxT.solve = 0;
		for (int j = i; j < Group.size(); j++){
			if(compare(maxT,Group[j])){
				maxT = Group[j];
				maxj = j;
			}
		}
		Team tmp = Group[i];
		Group[i] = Group[maxj];
		Group[maxj] = tmp;
	}
	
}

void result_print(vector<Team> Group){
	cout << Group[0].id;
	int old_solve = Group[0].solve;
	int old_time = Group[0].time;
	for (int i = 1; i < Group.size(); i++){
		if (old_solve == Group[i].solve and old_time == Group[i].time){
			cout << "=" <<  Group[i].id ;	
		}else{
			cout << "," << Group[i].id; 
		}
		old_solve = Group[i].solve;
		old_time = Group[i].time;
	}
	cout << endl;
}

int main() {

	while(1){
		int M,T,P,R; cin >> M >> T >> P >> R;
		if (M + T + P + R ==0) break;
		
		vector<Team> Group(T);

		for (int i = 0; i < T; i++){
			Group[i].set(P,i+1);	
		}
		for (int i = 0 ; i < R; i++){
			int m,t,p,r;
			cin >> m >> t >> p >> r;
			if (r == 0){//correct
				Group[t-1].time += m + Group[t-1].check[p-1] * (20);
				Group[t-1].check[p-1] = 0;
				Group[t-1].solve++;
			}else{
				Group[t-1].check[p-1]++;
			}
		}
		result_sort(Group);
		result_print(Group);
	}
	return 0;
}

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

struct Team {
    int team_id;
    int ac_num;
    int time;
    int fail[10];
};

auto cmp = [](Team x, Team y) {
    if (x.ac_num != y.ac_num) {
        return x.ac_num > y.ac_num;
    }
    else if (x.time != y.time) {
        return x.time < y.time;
    }
    else {
        return x.team_id > y.team_id;
    }
};

int main()
{
    int M, T, P, R;
    int m, p, t, j;
    vector<Team> team(50);

    while(1) 
    {
        cin >> M >> T >> P >> R;
        if ((M == 0) && (T == 0) && (P == 0) && (R == 0)) {
            break;
        }

        for (int i = 0; i < 50; i++) {
            team[i].team_id = i+1;
            team[i].ac_num = 0;
            team[i].time = 0;
            for (int j = 0; j < 10; j++) {
                team[i].fail[j] = 0;
            }
        }
        
        for (int i = 0; i < R; i++) {
            cin >> m >> t >> p >> j;
            if (j != 0) {
                team[t-1].fail[p-1] += 1;
            }
            else {
                team[t-1].ac_num += 1;
                team[t-1].time += m;
                if (team[t-1].fail[p-1] > 0) {
                    team[t-1].time += 20*team[t-1].fail[p-1];
                }
            }
        }

        sort(team.begin(), team.begin()+T, cmp);

        for (int i = 0; i < T; i++) {
            if (i == 0)
                cout << team[i].team_id;
            else {
                if (team[i].ac_num != team[i-1].ac_num)
                    cout << "," << team[i].team_id;
                else if (team[i].time != team[i-1].time)
                    cout << "," << team[i].team_id;
                else {
                    cout << "=" << team[i].team_id;
                }
            }
        }
        cout << endl;
    }
    return 0;
}