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 <vector>
#include <algorithm>

using namespace std;

typedef pair< int, int> pii;
typedef pair< int, pii> piii;

int M, T, P, R;

int main() {
	while (1) {
		cin >> M >> T >> P >> R; if (M==0 && T==0 && P==0 && R==0) break;
		
		vector<piii> pv(T);
		vector< vector<int> > end(T, vector<int>(P, 0) );
		for (int i = 0; i < T; i++) pv[i] = make_pair(0, make_pair(0, i + 1) );
		for (int i = 0; i < R; i++) {
			int m, t, p, j; cin >> m >> t >> p >> j;
			if (end[t-1][p-1] > 0) continue;
			if (m > M) continue;
			if (j==0) {
				pv[t-1].first++;
				pv[t-1].second.first -= m;
				end[t-1][p-1] = (-1)*end[t-1][p-1];
			} else {
				end[t-1][p-1]--;
			}
		}

		for (int i = 0; i < T; i++) {
			for (int j = 0; j < P; j++) {
				if (end[i][j] <= 0) continue;
				pv[i].second.first -= 20 * end[i][j];
			}
		}

		sort(pv.begin(), pv.end());
		for (int i = T-1; i >= 0; i--) {
			if (i > 0 && pv[i].first == pv[i-1].first && pv[i].second.first == pv[i-1].second.first) {
				cout << pv[i].second.second << "=";
			} else {
				cout << pv[i].second.second;
				if (i > 0) cout << ",";
			}
		}
		cout << endl;
	}	

	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
    while(1){
        int m, t, p, r;
        cin >> m >> t >> p >> r;
        if (m == 0) break;
        vector<vector<bool>> ac(t, vector<bool>(p, false));
        vector<vector<int>> solved(t, vector<int>(p, 0));
        int v, w, x, y;
        for (int i = 0; i < r; i++){
            cin >> v >> w >> x >> y;
            w--; x--;
            if (y == 0){
                ac[w][x] = true;
                solved[w][x] += v;
            }
            else {
                solved[w][x] += 20;
            }
        }
        vector<tuple<int, int, int>> ans(t);
        for (int i = 0; i < t; i++){
            int a = 0;
            int b = 0;
            int c = i + 1;
            for (int j = 0; j < p; j++){
                if (ac[i][j]){
                    a++;
                    b -= solved[i][j];
                }
            }
            ans[i] = tie(a, b, c);
        }
        sort(ans.begin(), ans.end(), greater<tuple<int, int, int>>());
        int tmp = -1;
        int tmp2 = -1;
        for (int i = 0; i < t; i++){
            if (i == 0);
            else if (get<0>(ans[i]) == tmp && get<1>(ans[i]) == tmp2) cout << "=";
            else cout << ",";
            cout << get<2>(ans[i]);
            tmp = get<0>(ans[i]);
            tmp2 = get<1>(ans[i]);
        }
        cout << endl;
    }
}

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

using namespace std;
typedef pair<int,int> mp;

int main(){
    while(true){
        int m,t,p,r;
        cin >> m >> t >> p >> r;
        if(m==0)break;
        vector<vector<int> > score(t,vector<int>(p,-1));
        for(int i=0;i<r;i++){
            int m1,t1,p1,j;
            cin >> m1 >> t1 >> p1 >> j;
            t1--;
            p1--;
            if(j!=0){
                score[t1][p1]-=20;
            }
            else{
                if(score[t1][p1]<-1){
                    score[t1][p1]=m1-score[t1][p1]-1;
                }
                else{
                    score[t1][p1]=m1;
                }
            }
        }
        vector<pair<mp,int> > pr(t);
        pair<mp,int> temp;
        for(int i=0;i<t;i++){
            temp.first.first=0;
            temp.first.second=0;
            temp.second=-(i+1);
            pr[i]=temp;
            for(int j=0;j<p;j++){
                if(score[i][j]>=0){
                    temp.first.first--;
                    temp.first.second+=score[i][j];
                    pr[i]=temp;
                }
            }
        }
        sort(pr.begin(),pr.end());
        for(int i=0;i<t;i++){
            cout << -pr[i].second;
            if(i<t-1 && pr[i].first==pr[i+1].first)cout << '=';
            else if(i!=t-1)cout << ',';
        }
        cout << endl;

    }
    return 0;
}