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>
#include <vector>
#include <tuple>
#include <algorithm>

typedef std::tuple<int, int, int, int> A;
typedef std::tuple<int, int, int> S;
int main()
{
	while(true){
		int M, T, P, R;
		std::cin >> M >> T >> P >> R;
		if ( M == 0 && T == 0 && P == 0 && R == 0 ) break;

		std::vector<A> data;
		for ( int i = 0;i < R; ++i ) {
			int m, t, p, j;
			std::cin >> m >> t >> p >> j;
			data.push_back(A(m, t, p, j));
		}

		std::vector<S> team(T);

		for ( int i = 0; i < team.size(); ++i ) {
			int ans = 0;
			int min = 0;
			int tn = i + 1;

			std::vector<bool> pro(P, false);

			for ( int j = data.size()-1; j >= 0; j-- ) {
				if ( std::get<1>(data[j]) != tn ) continue;
				if ( std::get<3>( data[j] ) == 0 && pro[std::get<2>( data[j] )] == false ) {
					ans++;
					min += std::get<0>(data[j]);
					pro[std::get<2>( data[j] )] = true;
				}

				if ( std::get<3>( data[j] ) != 0 && pro[std::get<2>( data[j] )] == true ) {
					min += 20;
				}
			}
			std::get<0>(team[i]) = ans;
			std::get<1>(team[i]) = min;
			std::get<2>(team[i]) = tn;
		}

		std::sort(team.begin(), team.end(), [](const S& l, const S& r){ return std::get<2>(l) > std::get<2>(r); });
		std::stable_sort(team.begin(), team.end(), [](const S& l, const S& r){ return std::get<1>(l) < std::get<1>(r); });
		std::stable_sort(team.begin(), team.end(), [](const S& l, const S& r){ return std::get<0>(l) > std::get<0>(r); });
		std::cout << std::get<2>(team[0]);
		for ( int i  = 1; i < team.size(); ++i ) {
			if ( std::get<0>(team[i-1]) == std::get<0>(team[i]) && std::get<1>(team[i-1]) == std::get<1>(team[i]) ) {
				std::cout << "=";
			} else {
				std::cout << ",";
			}
			std::cout << std::get<2>(team[i]);
		}
		std::cout << std::endl;
	}


	return 0;
}

C++: #include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < n; i++)

typedef long long ll;
using namespace std;
int mod = 1000000007;

int solve[51]; //最後にACした時間
int num_pr[51];
int wa[51][11]; //waした回数
bool valid[51][11]; //acしたかどうか

void init(){
    rep(i, 51) {solve[i] = 0; num_pr[i] = 0;}
    rep(i, 51) rep(j, 11) {wa[i][j] = 0; valid[i][j] = false;}
}

int main(void){
    int M, T, P, R;

    //<解いた問題数> <解いた時間(短い方がいい)> <チーム番号(大きい方が先に出力)>

    while(true){
        init();
        cin >> M >> T >> P >> R;
        if(M == 0) break;
        pair<int, pair<int, int>> res[T];

        rep(i, R){
            int m, t, p, r; cin >> m >> t >> p >> r;
            t--; p--;
            if(r == 0){
                valid[t][p] = true;
                num_pr[t]++;
                solve[t] -= m;
            }
            else wa[t][p]++;
        }
        rep(i, T){
            rep(j, P){
                if(valid[i][j]) solve[i] -= 20*wa[i][j];
            }
        }

        rep(i, T){
            res[i] = make_pair(num_pr[i], make_pair(solve[i], i+1));
        }
        sort(res, res+T, greater<pair<int, pair<int, int>>>());
        rep(i, T){
            if(i == T-1) cout << res[i].second.second << endl;
            else if(res[i].first == res[i+1].first && res[i].second.first == res[i+1].second.first) cout << res[i].second.second << "=";
            else cout << res[i].second.second << ",";
        }
    }
    return 0;
}

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

const int INF=5000000;

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;
	}
}