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;

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+=',';
        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 <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n) { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
	int m, t, p, r;
	while (cin >> m >> t >> p >> r, m) {
		vector<pair<int, pii>> score(t,pair<int,pii>(0,pii(0,0)));//point time team
		REP(i, t)
			score[i].second.second = -(i + 1);
		vvi pena(t, vi(p, 0));//team pro
		REP(j, r) {
			int time, t2, p2, ju;
			cin >> time >> t2 >> p2 >> ju;
			t2--;
			p2--;
			if (ju == 0) {
				score[t2].first--;
				score[t2].second.first += pena[t2][p2] * 20 + time;
			}
			else {
				pena[t2][p2]++;
			}
		}
		SORT(score);
		int ac;
		int ti;
		REP(i, t) {
			if (i == 0) {
				ac = score[i].first;
				ti = score[i].second.first;
				cout << -score[i].second.second;
			}else{
				if (ac == score[i].first&& ti == score[i].second.first)
					cout << "=";
				else
					cout << ",";
				cout<< -score[i].second.second;
				ac = score[i].first;
				ti = score[i].second.first;
			}
		}
		cout << endl;
	}
}

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

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

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

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

		int  tnow,tpre=-1;
		bool flg[50];
		for(int i=0;i<T;i++){
			flg[i]=false;
		}

		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[tnoaw]==CP[tpre]&&TT[tpre]==TT[tnow]){
					cout<<'=';
				}
				else{
					cout<<'.';
				}
			}
			cout<<tnow+1;
		
			flg[tnow]=true;
			tpre=tnow;
		}
		cout<<endl;
	}
	
	return 0;
}