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>
using namespace std;
int main() {
	int m, t, p, r;
	while (cin >> m >> t >> p >> r, m) {
		pair<pair<int, int>, pair<int, int>>log[2014];
		//time team problem result
		for (int i = 0; i < r; i++) 
			cin >> log[i].first.first >> log[i].first.second >> log[i].second.first >> log[i].second.second;
		pair<pair<int, int>, int>point[60];
		//problems penalty teamnum
		int penalty[60][15] = {};
		for (int i = 1; i <= t; i++) {
			point[i].first.first = 15;
			point[i].first.second = 0;
			point[i].second = i;
		}
		for (int i = 0; i < r; i++) {
			if (log[i].second.second) {
				//WRONG ANSWER
				penalty[log[i].first.second][log[i].second.first]++;
			}
			else{
				//ACCEPTED
				point[log[i].first.second].first.first--;
				point[log[i].first.second].first.second += penalty[log[i].first.second][log[i].second.first] * 20 + log[i].first.first;
			}
		}
		for (int i = 1; i < t; i++) {
			for (int j = i + 1; j <= t; j++) {
				if (point[i].first > point[j].first)swap(point[i], point[j]);
				else if (point[i].first == point[j].first)if (point[i].second < point[j].second)swap(point[i], point[j]);
			}
		}
		cout << point[1].second;
		for (int i = 2; i <= t; i++) {
			if (point[i].first == point[i - 1].first)cout << '=';
			else cout << ',';
			cout << point[i].second;
		}
		cout << endl;
	}
}

C++: #include <iostream>
#include <algorithm>

using namespace std;

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

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

        int m, t, p, j;
        int result[T];
        fill(result, result + T, 0);
        int time[T];
        fill(time, time + T, 0);
        int failure[T];
        fill(failure, failure + T, 0);
        for (int submit = 0; submit < R; submit++) {
            cin >> m >> t >> p >> j;
            if (j == 0) {
                result[t - 1] += 1;
                time[t - 1] += m + failure[t - 1] * 20;
            } else {
                ++failure[t - 1];
            }
        }

        bool done[T];
        fill(done, done + T, false);
        int prevPoint, prevTime;
        for (int count = 0; count < T; count++) {
            int maxPoint = -1;
            int maxTeam = 0;
            int minTime = 100000;
            for (int i = T - 1; i >= 0; i--) {
                if (done[i]) continue;
                if (maxPoint < result[i]) {
                    maxPoint = result[i];
                    maxTeam = i + 1;
                    minTime = time[i];
                } else if (maxPoint == result[i]) {
                    if (minTime > time[i]) {
                        minTime = time[i];
                        maxTeam = i + 1;
                    }
                }
            }
            minTime = time[maxTeam - 1];
            if (count != 0) {
                if (maxPoint == prevPoint && minTime == prevTime) cout << "=";
                else cout << ",";
            }
            cout << maxTeam;
            done[maxTeam - 1] = true;
            prevPoint = maxPoint;
            prevTime = minTime;
        }
        cout << endl;
    }
}

C++: #include <iostream>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <random>
#include <complex>
#include <assert.h>

using namespace std;
typedef long long ll;
#define endl '\n'

template<typename T>
inline bool chmin(T& x, T a) {
	if (x >= a) { x = a; return true; }
	return false;
}

template<typename T>
inline bool chmax(T& x, T a) {
	if (x <= a) { x = a; return true; }
	return false;
}

int main() {
	ios::sync_with_stdio(false);
	std::cin.tie(0);

	while (1) {
		int M, T, P, R; cin >> M >> T >> P >> R;
		if (M == 0) { break; }

		vector<vector<ll>> penalty(T);
		vector<ll> solved(T, 0);
		vector<ll> elapsed(T, 0);

		for (int i = 0; i < T; i++) {
			penalty[i].resize(P, 0);
		}
		for (int i = 0; i < R; i++) {
			int m, t, p, _j; cin >> m >> t >> p >> _j;
			bool judge = (_j == 0);
			t--;
			p--;
			if (judge == true) {
				solved[t]++;
				elapsed[t] += m + 20 * penalty[t][p];
			}
			else {
				penalty[t][p]++;
			}
		}
		vector<pair<ll, int>> ans;
		for (int i = 0; i < T; i++) {
			ll score = -10000000LL * solved[i] + elapsed[i];
			ans.push_back({ score, -i - 1 });
		}
		sort(ans.begin(), ans.end());
		for (int i = 0; i < T; i++) {
			if (i != 0) {
				if (ans[i].first == ans[i - 1].first) {
					cout << "=";
				}
				else {
					cout << ",";
				}
			}
			cout << -ans[i].second;
		}
		cout << endl;
	}

	return 0;
}