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 <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <string>

using namespace std;

const int MAX_P=10,MAX_T=50,MAX_R=2000;
const int MAX_CASE=100;

struct data{
	int ans;	//??£?§£??°
	int time;	//????????????
	int pena[MAX_P];	//??????i?????????????????£???
	int index;	//???????????????
};

bool comp(const data &a,const data &b){
	if (a.ans!=b.ans)
		return a.ans>b.ans;
	if (a.time!=b.time)
		return a.time<b.time;
	return a.index>b.index;
}

bool same(const data &a,const data &b){
	if (a.ans==b.ans && a.time==b.time){
		return true;
	}
	return false;
}

int A[MAX_CASE],B[MAX_CASE],C[MAX_CASE],D[MAX_CASE];
int ma[MAX_CASE][MAX_R],ta[MAX_CASE][MAX_R],pa[MAX_CASE][MAX_R],ja[MAX_CASE][MAX_R];

data d[MAX_T];

int main(){
	int q=0;
	do{
		int n,t,p,r;
		scanf("%d %d %d %d",A+q,B+q,C+q,D+q);
		for (int i=0;i<D[q];i++){
			scanf("%d %d %d %d",&ma[q][i],&ta[q][i],&pa[q][i],&ja[q][i]);
		}
		q++;
	}while (A[q-1]!=0);
	int N,T,P,R;
	for (int k=0;k<q;k++){
		N=A[k],T=B[k],P=C[k],R=D[k];
		for (int i=0;i<T;i++){
			d[i].ans=d[i].time=0;
			d[i].index=i+1;
			memset(d[i].pena,0,sizeof(d[i].pena));
		}
		for (int i=0;i<R;i++){
			int m,t,p,j;
			m=ma[k][i],t=ta[k][i],p=pa[k][i],j=ja[k][i];
			data &da=d[t-1];
			if (j==0){
				//??£?§£
				da.time+=m+da.pena[p-1];
				da.ans++;
			}
			else{
				//?????£?§£
				da.pena[p-1]+=20;	//??????????????£???
			}
		}
		sort(d,d+T,comp);
		for (int i=0;i<T;i++){
			if (i){
				if (same(d[i],d[i-1])){
					printf("=");
				}
				else{
					printf(",");
				}
			}
			printf("%d",d[i].index);
		}
		if (k!=q-1)
			printf("\n");
	}
	return 0;
}

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

int main(){
    int M, T, P, R;
    while(cin >> M >> T >> P >> R, M){
        vector< pair< pair<int, int>, int> > data(T);
        for(int i = 0 ; i < T ; i++){
            data[i].second = -i;
        }
        vector< vector< pair<bool, int> > > solved(T, vector< pair<bool, int> >(P));
        for(int i = 0 ; i < R ; i++){
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            t--;
            p--;
            if(j == 0){
                data[t].first.first--;
                data[t].first.second += solved[t][p].second + m;
                solved[t][p].first = true;
            }else if(!solved[t][p].first){
                solved[t][p].second += 20;
            }
        }

        sort(data.begin(), data.end());

        string ans = to_string(-data[0].second + 1);
        for(int i = 1 ; i < T ; i++){
            if(data[i].first == data[i - 1].first){
                ans.push_back('=');
            }else{
                ans.push_back(',');
            }
            ans += to_string(-data[i].second + 1);
        }

        cout << ans << endl;
    }
}

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

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

        int ap[55] = {};
        int at[55] = {};
        int pen[55][11] = {};

        for(int i=0;i<R;i++){
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            if(j==0){
                ap[t]++;
                at[t]+=m+20*pen[t][p];
            }else{
                pen[t][p]++;
            }
        }

        bool c_flag = false;
        for(int i=10;i>=0;i--){
            for(int j=0;j<300*11;j++){
                bool e_flag = false;
                for(int k=T;k>=1;k--){
                    if(ap[k]==i && at[k]==j){
                        if(e_flag){
                            cout << '=';
                        }else if(c_flag){
                            cout << ',';
                        }
                        c_flag = true;
                        e_flag = true;
                        cout << k;
                    }
                }
            }
        }
        cout << endl;
    }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>

using namespace std;
typedef tuple<int, int, int> tiii;

int main(){
	ios_base::sync_with_stdio(false);
	while(true){
		int m, t, p, r;
		cin >> m >> t >> p >> r;
		if(m == 0 && t == 0 && p == 0 && r == 0){ break; }
		vector<vector<int>> wrong_count(t, vector<int>(p));
		vector<tiii> order(t);
		for(int i = 0; i < t; ++i){ order[i] = tiii(0, 0, -(i + 1)); }
		for(int i = 0; i < r; ++i){
			int mi, ti, pi, ji;
			cin >> mi >> ti >> pi >> ji;
			--ti; --pi;
			if(wrong_count[ti][pi] < 0){ continue; }
			if(ji == 0){
				--get<0>(order[ti]);
				get<1>(order[ti]) += mi + wrong_count[ti][pi] * 20;
				wrong_count[ti][pi] = -1;
			}else{
				++wrong_count[ti][pi];
			}
		}
		sort(order.begin(), order.end());
		for(int i = 0; i < t; ++i){
			if(i > 0){
				const int j = i - 1;
				if(get<0>(order[j]) == get<0>(order[i]) && get<1>(order[j]) == get<1>(order[i])){
					cout << "=";
				}else{
					cout << ",";
				}
			}
			cout << -get<2>(order[i]);
		}
		cout << endl;
	}
	return 0;
}