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 rep(i,n) for(long long int i=0;i<n;++i)
typedef long long int ll;

int main(){

    while(1){
        int M,T,P,R;
        cin >> M >> T >> P >> R;
        if(M==0&&T==0&&P==0&&R==0)break;
        vector<vector<int>> wa(T,vector<int>(P,0));
        vector<vector<bool>> ac(T,vector<bool>(P,false));
        vector<int> cnt(T,0);
        vector<pair<int,int>> mt(T,{0,0});
        rep(i,T){
            mt[i].second=-(i+1);
        }
        rep(i,R){
            int m,t,p,j;
            cin >> m >> t >> p >> j;
            t--;p--;
            if(j!=0){
                wa[t][p]++;
            }else{
                mt[t].first+=m;
                ac[t][p]=true;
            }
        }
        vector<vector<pair<int,int>>> accnt(P+1);
        for(int i=T-1;i>=0;i--){
            for(int j=0;j<P;j++){
                if(ac[i][j]){
                    cnt[i]++;
                    mt[i].first+=20*wa[i][j];
                }
            }
            accnt[cnt[i]].push_back(mt[i]);
        }
        rep(i,P+1){
            stable_sort(accnt[i].begin(),accnt[i].end());
        }
        int cn=0;
        for(int i=P;i>=0;i--){
            for(int j=0;j<(int)accnt[i].size()-1;j++){
                cout << -accnt[i][j].second;
                cn++;
                if(accnt[i][j].first==accnt[i][j+1].first){
                    cout << "=";
                }else{
                    cout << ",";
                }
            }
            if(accnt[i].size()>0){
                cout << -accnt[i].back().second;
                cn++;
                if(cn!=T)cout << ",";
            }
        }
        cout<< endl;
    }

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
    int m,t,p,r;
    while(cin>>m>>t>>p>>r,m){
        vector<vector<int>> team(t,vector<int>(p,0));
        for(int i=0;i<r;i++){
            int mm,tt,pp,jj;
            cin>>m>>tt>>pp>>jj;
            if(!jj)
                team[tt-1][pp-1]=m+(-team[tt-1][pp-1])*20;
            else
                team[tt-1][pp-1]--;

        }
        vector<tuple<int,int,int>> rank(t,make_tuple(0,0,0));
        for(int i=0;i<t;i++)
            get<2>(rank[i])=i+1;
        for(int i=0;i<t;i++){
            for(int j=0;j<p;j++)
                if(team[i][j]>0){
                    (get<0>(rank[i]))++;
                    get<1>(rank[i])-=team[i][j];
                }


        }
        sort(rank.begin(),rank.end(),greater<tuple<int,int,int>>());
        queue<int> q;
        pair<int,int> pre=make_pair(-1,-1);
        string res="";
        for(int i=0;i<t;i++){
            if(pre==make_pair(get<0>(rank[i]),get<1>(rank[i]))){
                q.push(get<2>(rank[i]));
                continue;
            }
            else{
                if(!res.empty())
                    res+=",";
                int s=q.size();
                for(int j=0;j<s;j++){
                    int a=q.front();
                    if(j!=s-1){
                        res+=to_string(a)+"=";
                        }
                    else
                        res+=to_string(a);

                    q.pop();

                }
                q.push(get<2>(rank[i]));
                pre=make_pair(get<0>(rank[i]),get<1>(rank[i]));
            }

        }
        if(!q.empty() && res.back()!=',')
            res+=',';
        for(int i=0;!q.empty();i++){
            if(q.size()!=1){
                res+=to_string(q.front())+"=";

            }
            else
                res+=to_string(q.front());
            q.pop();
        }
        cout<<res<<endl;
    }

    return 0;
}

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

int M, T, P, R;

struct Team{
	int id, ac, timecost;
	int wa[11];
	Team(int i){
		id = i;
		ac = 0; timecost = 0;
		for(int i = 0; i < 11; i++) wa[i] = 0;
	}
};

bool compare(const Team &a, const Team &b){
	if(a.ac != b.ac) return a.ac > b.ac;
	else if(a.timecost != b.timecost) return a.timecost < b.timecost;
	else return a.id > b.id;
}

int main(){
	while(cin >> M >> T >> P >> R && M != 0 && T != 0 && P != 0 && R != 0){
		vector<Team> teams;
		for(int i = 0; i < T; i++){
			Team t(i);
			teams.push_back(t);
		}

		for(int i = 0; i < R; i++){
			int m, t, p, j;
			cin >> m >> t >> p >>j;
			if(j == 0){
				teams[t-1].ac++;
				teams[t-1].timecost = m + teams[t-1].wa[p] * 20;
			}else{
				teams[t-1].wa[p]++;
			}
		}

		sort(teams.begin(), teams.end(), compare);

		int p_ac = -1, p_tc = -1;
		for(int i = 0; i < T; i++){
			if(p_ac == teams[i].ac && p_tc == teams[i].timecost){
				cout << "=" << teams[i].id + 1;
			}else if(i != 0){
				cout << "," << teams[i].id + 1;
				p_ac = teams[i].ac;
				p_tc = teams[i].timecost;
			}else{
				cout << teams[i].id + 1;
				p_ac = teams[i].ac;
				p_tc = teams[i].timecost;
			}
		}
		cout << endl;
	}
	return 0;
}