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 <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++) {
            //cout << i << " : " << data[i][0][1] << " : " << data[i][0][0] << endl;
            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++) {
                //cout << " *f.f = " << (*f).first << " *it.f = " << (*it).first << " tmp size = " << tmp.size() << endl;
                if ((*f).first == (*it).first) tmp.push((*it).second); 
                else {
                    if (ans.size()) ans.push(-1);
                    while (tmp.size()) {
                        advance( f, 3);
                        auto ss = tmp.top(); tmp.pop();
                        //cout << "ss " << ss << endl;
                        ans.push(ss);
                        if (tmp.size()) ans.push(-3);
                    }
                    tmp.push((*it).second);
                    //advance( f, 2);
                    //cout << (*f).first << endl;
                }
            }
            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<algorithm>
#include<vector>
using namespace std;
#define REP(i, a, n) for(int i=a; i<n; i++)
#define MP(a, b) make_pair(a, b)
#define F first
#define S second

int main() {
	int M, T, P, R;
	while (cin >> M >> T >> P >> R) {
		vector<pair<int, pair<int, int>>> vp;  // correct, time, team
		int pena[51][11];

		REP(i, 0, T) vp.push_back(MP(0, MP(0, i + 1)));
		REP(i, 0, 51) REP(j, 0, 11) pena[i][j] = 0;

		REP(i, 0, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			p--;

			if (j == 0) {
				vp[t].F++;
				vp[t].S.F -= (pena[t][p] + m);
			}
			else {
				pena[t][p] += 20;
			}
		}

		sort(vp.begin(), vp.end());
		reverse(vp.begin(), vp.end());

		cout << vp[0].S.S;
		REP(i, 1, vp.size()) {
			if (vp[i - 1].F > vp[i].F) {
				cout << "," << vp[i].S.S;
			}
			else if (vp[i - 1].S.F > vp[i].S.F) {
				cout << "," << vp[i].S.S;
			}
			else {
				cout << "=" << vp[i].S.S;
			}
		}

		cout << endl;
	}
	return 0;
}

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

struct team_data {
    int id;
    int solved;
    int time;
    map<int, int> wrong;
};

int main() {
    int M, T, P, R;
    while(cin >> M >> T >> P >> R, M) {
        vector<team_data> v(T);
        for(int i=0; i<v.size(); ++i) {
            v[i].id = i+1;
        }

        for(int i=0; i<R; ++i) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            if(j == 0) { // correct
                v[t-1].time += m + v[t-1].wrong[p];
                v[t-1].solved++;
            } else { // wrong
                v[t-1].wrong[p] += 20;
            }
        }
        sort(v.begin(), v.end(), [](auto const& t1, auto const& t2) {
            return t1.id > t2.id;
        });
        stable_sort(v.begin(), v.end(), [](auto const& t1, auto const& t2) {
            if(t1.solved == t2.solved) {
                return t1.time < t2.time;
            } else {
                return t1.solved > t2.solved;
            }
        });

        for(int i=0; i<v.size(); ++i) {
            cout << v[i].id;
            if(i != v.size()-1) {
                if(v[i].solved == v[i+1].solved && v[i].time == v[i+1].time) {
                    cout << '=';
                } else {
                    cout << ',';
                }
            }
        }
        cout << endl;
    }
}