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 <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 namespace std;

typedef vector<int> VI;
typedef vector<vector<int> > VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef vector<PII> VP;
typedef vector<vector<PII> > VVP;

int main(void) {
    while(true) {
        int m;
        int t;
        int p;
        int r;
        cin >> m >> t >> p >> r;
        if (m == 0 && t == 0 && p == 0 && r == 0) {
            break;
        }
        VVP table(t, VP(p, make_pair(0, 1)));
        for (int i = 0; i < r; i++) {
            int m2;
            int t2;
            int p2;
            int j;
            cin >> m2 >> t2 >> p2 >> j;
            t2--;
            p2--;
            if (j == 0) {
                table[t2][p2].first += m2;
                table[t2][p2].second = j;
            } else {
                table[t2][p2].first += 20;
            }
        }
        priority_queue<PIII> pq;
        for (int i = 0; i < t; i++) {
            int solve = 0;
            int total_time = 0;
            for (int j = 0; j < p; j++) {
                if (table[i][j].second == 0) {
                    solve++;
                    total_time += table[i][j].first;
                }
            }
            pq.push(make_pair(solve, make_pair(-total_time, i + 1)));
        }
        PIII ans = pq.top();
        int solve = ans.first;
        int time = ans.second.first;
        pq.pop();
        cout << ans.second.second;
        while(!pq.empty()) {
            PIII ans = pq.top();
            if (ans.first == solve && ans.second.first == time) {
                cout << "=" << ans.second.second;
            } else {
                solve = ans.first;
                time = ans.second.first;
                cout << "," << ans.second.second;
            }
            pq.pop();
        }
        cout << endl;
    }
    return 0;
}

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

using namespace std;

struct Score {
    int id;
    int solve;
    int time;

    Score () : id(0), solve(0), time(0) {}
    ~Score () {}

    Score(int a, int b, int c) : id(a), solve(b), time(c) {}

    bool operator < (const Score& o) const {
        if(solve != o.solve) return solve > o.solve;
        if(time != o.time) return time < o.time;
        return id > o.id;
    }

    bool operator == (const Score& o) const {
        return solve == o.solve && time == o.time;
    }
};

int main () {
    int M, T, P, R;

    while (true) {
        cin >> M >> T >> P >> R;
        if (M == 0) return 0;

        vector<vector<char>> solved(T, vector<char>(P, 0));
        vector<vector<int> > time(T, vector<int>(P, 0));
        vector<vector<int> > miss(T, vector<int>(P, 0));

        for (int i = 0; i < R; ++i) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            --t; --p;

            if (j == 0) {
                solved[t][p] = 1;
                time[t][p] = m;
            } else {
                ++ miss[t][p];
            }
        }

        vector<Score> scores;

        for (int i = 0; i < T; ++i) {
            int s = 0, t = 0;
            for(int j = 0; j < P; ++j) {
                if(solved[i][j]) {
                    ++s;
                    t += time[i][j] + miss[i][j] * 20;
                }
            }

            scores.push_back(Score(i + 1, s, t));
        }

        sort(begin(scores), end(scores));

        cout << scores[0].id;
        for(int i = 1; i < scores.size(); ++i) {
            cout << ((scores[i - 1] == scores[i]) ? "=" : ",");
            cout << scores[i].id;
        }
        cout << endl;
    }
    return 0;
}