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++: #define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<list>
#include<stack>
#include<queue>
#include<cctype>
#include<iomanip>
#include<functional>
using namespace std;
typedef long long llong;
int M, T, P, R;
class Team {
public:
	int problems[10];
	int ac;
	int number;
	int time;
	int rank;
};

bool f(Team a, Team b) {
	if (a.ac == b.ac&&a.time == b.time)return a.number > b.number;
	else if (a.ac == b.ac)return a.time < b.time;
	else return a.ac > b.ac;
}
int main() {
	while (1) {
		cin >> M >> T >> P >> R;
		if (!M && !T && !P && !R)break;
		vector<int>m(R), t(R), p(R), j(R);

		vector<Team>team(T);
		for (int i = 0; i < T; i++) {
			team[i].number = i + 1;
			team[i].ac = team[i].time = 0;
			for (int j = 0; j < 10; j++) {
				team[i].problems[j] = 0;
			}
		}
		for (int i = 0; i < R; i++) {
			cin >> m[i] >> t[i] >> p[i] >> j[i];
			t[i]--;
			p[i]--;
			if (j[i] == 0) {
				if (team[t[i]].problems[p[i]] == 0) {
					team[t[i]].problems[p[i]] = 1;
					team[t[i]].time += m[i];
					team[t[i]].ac++;
				}
				else if (team[t[i]].problems[p[i]] < 0) {
					team[t[i]].time += (m[i] + 20*(-team[t[i]].problems[p[i]]));
					team[t[i]].problems[p[i]] = 1;
					team[t[i]].ac++;
				}
			}
			else {
				team[t[i]].problems[p[i]]--;
			}

		}
		sort(team.begin(), team.end(), f);
		for (int i = 0; i < T; i++) {
			if (i) {
				if (team[i].ac == team[i - 1].ac&&team[i].time == team[i - 1].time) {
					cout << '=';
				}
				else {
					cout << ',';
				}
			}
			cout << team[i].number;

		}
		cout << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>

using std::cin;
using std::cout;
using std::endl;
using std::setprecision;
using std::fixed;
using std::pair;
using std::make_pair;
using std::string;
using std::vector;
using std::list;
using std::map;
using std::set;
using std::queue;
using std::priority_queue;
using std::stack;

typedef vector<int> VI;
typedef vector<vector<int> > VII;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, bool> PIB;

struct SCORE {
    vector<PIB> time;
    int total_time;
    int solve;
    SCORE() {
        total_time = 0; 
        solve = 0; 
    }
};

int main(void) {
    int m; // time
    int t; // number of team
    int p; // number of problems
    int r; // number of post records
    while (1) {
        cin >> m >> t >> p >> r;
        if (m == 0 && t == 0 && p == 0 && r == 0) {
            break; 
        }
        vector<SCORE> rec(t);

        // constructor????????????????????????????????????????????????
        vector<PIB> temp(p, make_pair(0, false));
        for (int i = 0; i < t; i++) {
            rec[i].time = temp;
        }

        for (int loop = 0; loop < r; loop++) {
            int m2;
            int t2;
            int p;
            int j;
            cin >> m2 >> t2 >> p >> j;
            t2--;
            p--;
            if (j == 0) {
                rec[t2].solve++; 
                rec[t2].time[p].first += m2;
                rec[t2].time[p].second = true;
                rec[t2].total_time += rec[t2].time[p].first;
            } else {
                rec[t2].time[p].second += 20;
            }
        }
        priority_queue<pair<int, pair<int, int> > > pq;
        for (int i = 0; i < t; i++) {
           pq.push(make_pair(rec[i].solve, make_pair(rec[i].total_time, i + 1))); 
        }
        int first = pq.top().first;
        int second = pq.top().second.first;
        cout << pq.top().second.second;
        pq.pop();
        for (int i = 1; i < t; i++) {
            if (first == pq.top().first && second == pq.top().second.first) {
                cout << "=" << pq.top().second.second;
            } else {
                first = pq.top().first;
                second = pq.top().second.first;
                cout << "," << pq.top().second.second;
            }
            pq.pop();
        }
        cout << endl;
    }
    return 0;
}