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 <map>
#include <set>
#include <queue>
#include <vector>
#include <stdlib.h>
#include <algorithm>

#define rep(i,s,t) for(int i=s;i<t;i++)
#define mp(a,b) make_pair(a,b)
#define mii map<int,int>

using namespace std;

int main(void){

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

		map<int,map<int,set<int,greater<int> > >,greater<int> > standing;

		int solve[T+1];
		int time[T+1];
		int pena[T+2][P+1];
		rep(i,0,T+1){
			solve[i]=0;
			time[i]=0;
			rep(j,0,P+1)
				pena[i][j]=0;
		}

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

		rep(rnd,0,R){
			int m,t,p,j;
			cin >> m >> t >> p >> j;
			if(j==0){
				solve[t]++;
				time[t]+=m+pena[t][p]*20;
			}else{
				pena[t][p]++;
			}
		}

		rep(i,1,T+1)
			standing[solve[i]][time[i]].insert(i);

		int cnt=0;
		for(map<int,map<int,set<int,greater<int> > >,greater<int> > ::iterator it=standing.begin();it!=standing.end();it++){
			map<int,set<int,greater<int> > > inmp=(*it).second;
			for(map<int,set<int,greater<int> > >::iterator jt=inmp.begin();jt!=inmp.end();jt++){
				set<int,greater<int> > inset=(*jt).second;
				int size=inset.size();
				for(set<int,greater<int> >::iterator kt=inset.begin();kt!=inset.end();kt++){
					cout << (*kt);
					cnt++;
					if(--size>0) cout << "=";
				}
				if(cnt<T) cout << ",";
			}
		}
		cout << endl;


	}
	

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#define MAX_T 50
#define MAX_P 10
using namespace std;

typedef pair<int,int> S;
typedef vector<S> V;
typedef map<int,set<S>> MM;

bool pairCompare(const S& firstElof, const S& secondElof)
{
    return firstElof.second > secondElof.second;
}

int main(void)
{
    int M, T, P, R;
    while (cin >> M >> T >> P >> R) {
        if (M == 0 && T == 0 && P == 0 && R == 0) break;
        int m, t, p, j, data[T + 1][P + 1][2];
        memset(data, 0, sizeof(data));
        for (int i = 0; i < R; i++) {
            cin >> m >> t >> p >> j;
            if (j == 0) {
                data[t][0][0] += (m + data[t][p][1]);
                data[t][0][1]++;
            } else
                data[t][p][1] += 20;
        }
        V v;
        MM mm;
        queue<int> ans;
        for (int i = 1; i <= T; i++) {
            if (data[i][0][1] == 0) data[i][0][0] = -2;
            mm[data[i][0][1]].insert(S(data[i][0][0],i));
        }
        for (int i = P; i >= 0; i--) {
            stack<int> tmp;
            auto f = mm[i].begin();
            for (auto it = mm[i].begin(); it != mm[i].end(); it++) {
                if ((*f).first == (*it).first) tmp.push((*it).second); 
                else {
                    if (ans.size()) ans.push(-1);
                    while (tmp.size()) {
                        advance( f, 1);
                        auto ss = tmp.top(); tmp.pop();
                        ans.push(ss);
                        if (tmp.size()) ans.push(-3);
                    }
                    tmp.push((*it).second);
                }
            }
            if (tmp.size()) {
                if (ans.size())ans.push(-1);
                while (tmp.size()) {
                    auto ss = tmp.top(); tmp.pop();
                    ans.push(ss);
                    if (tmp.size()) ans.push(-3);
                }
            }
        }
        while (ans.size()) {
            int tmp = ans.front(); ans.pop();
            if (tmp == -1) cout << ",";
            else if (tmp == -3) cout << "=";
            else cout << tmp;
        }
        cout << endl;
        
    }
    
    return 0;
}

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

int main(int argc, char *argv[])
{
    int m, t, p, r, mk, tk, pk, jk, score, team, prev_pnt, prev_pnl;
    while (cin >> m >> t >> p >> r, m) {
        vector<int> ans(t + 1, 0);
        vector<int> penalty(t + 1, 0);
        vector<vector<int> > wrong(t + 1, vector<int>(p + 1, 0));
        for (int i = 0; i < r; ++i) {
            cin >> mk >> tk >> pk >> jk;
            if (jk != 0) {
                wrong[tk][pk]++;
            } else {
                ans[tk]++;
                penalty[tk] += 20 * wrong[tk][pk] + mk;
            }
        }
        prev_pnt = prev_pnl = -1;
        for (int i = 0; i < t; ++i) {
            score = -1;
            for (int j = 1; j <= t; ++j) {
                if (score < ans[j]) {
                    score = ans[j];
                    team = j;
                } else if (score == ans[j]) {
                    team = (penalty[team] < penalty[j]) ? team : j;
                }
            }
            if (i != 0 && prev_pnt == ans[team] && prev_pnl == penalty[team])
                cout << "=";
            else if (i != 0)
                cout << ",";
            cout << team;
            prev_pnt = ans[team];
            prev_pnl = penalty[team];
            ans[team] = -2;
        }
        cout << endl;
    }
    return 0;
}