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 <bits/stdc++.h>

using namespace std;

#define MAX_R 2005

typedef pair<int,int> PA;

int M,T,P,R;

int m,t,p,j;

int main(){
    while(1){
        cin >> M >> T >> P >> R;
        if(M==0 && T == 0 && P==0&&R==0)break;
        vector<int> solve(T);
        vector<int> time(T);
        int miss[51][11]={};
        for(int i=0;i<R;i++){
            cin >> m >> t >> p >> j;
            if(j == 0){
                solve[t-1]++;
                time[t-1] += m + miss[t-1][p] * 20;
            }else{
                miss[t-1][p] ++;
            }
        }

        vector<PA> ans1(T);
        vector<PA> ans2(T);
        for(int i=0;i<T;i++){
            ans1[i] = make_pair(solve[i],i+1);
            ans2[i] = make_pair(time[i],i+1);
        }
        
        sort(ans1.begin(),ans1.end());
        sort(ans2.begin(),ans2.end());
        for(int s=0;s<T;s++){
            for(int i=T-1;i>0;i--){
                if(ans1[i].first > ans1[i-1].first){
                }else if(ans1[i].first == ans1[i-1].first){
                    int a,b;
                    a=b=0;
                    for(int j=0;j<T;j++){
                        if(ans2[j].second == ans1[i].second){
                            a = ans2[j].first;
                        }
                        if (ans2[j].second == ans1[i-1].second){
                            b = ans2[j].first;
                        }
                        if(a != 0 && b== 0){
                            break;
                        }
                        if(a == 0 && b != 0){
                            swap(ans1[i].first,ans1[i-1].first);
                            swap(ans1[i].second,ans1[i-1].second);
                            break;
                        }
                    }
                }
            }
        }
        for(int s=0;s<T;s++){
            for(int i=T-1;i>=0;i--){
                if(i==T-1)continue;
                else{
                    if(ans1[i+1].first == ans1[i].first){
                        int a,b;
                        for(int j=0;j<T;j++){
                            if(ans2[j].second == ans1[i].second){
                                a = ans2[j].first;
                            }
                            if (ans2[j].second == ans1[i+1].second){
                                b = ans2[j].first;
                            }
                        }
                        if(a==b && ans1[i+1].second < ans1[i].second){
                            swap(ans1[i].first,ans1[i+1].first);
                            swap(ans1[i].second,ans1[i+1].second);
                        }
                    }
                }
            }
        }
        
        for(int i=T-1;i>=0;i--){
            if(i==T-1){
                printf("%d",ans1[i].second);
            }
            else{
                if(ans1[i+1].first > ans1[i].first){
                    printf(",%d",ans1[i].second);
                }else if(ans1[i+1].first == ans1[i].first){
                    int a,b;
                    for(int j=0;j<T;j++){
                        if(ans2[j].second == ans1[i].second){
                            a = ans2[j].first;
                        }
                        if (ans2[j].second == ans1[i+1].second){
                            b = ans2[j].first;
                        }
                    }
                    if(a==b){
                        printf("=%d",ans1[i].second);
                    }else{
                        printf(",%d",ans1[i].second);
                    }
                    
                }
            }
            
        }
        puts("");
        
    }
}

C++: // 2018/01/22 Tazoe

#include <iostream>
using namespace std;

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

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

		int CP[50];
		int TT[50];
		int 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;
			}
		}

//		for(int i=0; i<T; i++){
//			cout << CP[i] << ' ' << TT[i] << endl;
//		}

		bool flg[50];
		for(int i=0; i<T; i++){
			flg[i] = false;
		}

		int tnow, tpre = -1;

		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] = true;
			tpre = tnow;
		}
		cout << endl;
	}

	return 0;
}