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 <vector>

using namespace std;

const int MAX_T = 51;
const int MAX_P = 11;
typedef pair<int,int> PP;
typedef pair<PP,int> P;
 
int main(){
    int m,t,p,r,team[MAX_T][MAX_P],judge[MAX_T][MAX_P];
    int mi,ti,pi,ji,accnt[MAX_T];
 
    while(cin >> m >> t >> p >> r , m + t + p + r){
	vector<P> v;
	fill(team[0],team[MAX_T],0);
	fill(judge[0],judge[MAX_T],0);
	fill(accnt,accnt+MAX_T,0);
 
	for(int i = 0 ; i < r ; i++){
	    cin >> mi >> ti >> pi >> ji;
	    if(ji == 0){
		team[ti][pi] += mi + judge[ti][pi];
		accnt[ti]--;
	    }
	    else{
		judge[ti][pi] += 20;
	    }
	}
	int tt[MAX_T] = {0};
	for(int i = 1 ; i < MAX_T ; i++){
	    for(int j = 1 ; j < MAX_P ; j++){
		tt[i] += team[i][j];
	    } 
	}
	for(int i = 1 ; i <= t ; i++){
	    v.push_back(P(PP(accnt[i],tt[i]),-i));
	}
	sort(v.begin(),v.end());
	for(int i = 1 ; i <= v.size() ; i++){
	    if(v[i-1].first.first < v[i].first.first){
		cout << -v[i-1].second;
		if(i != v.size()) cout << ',';
	    }
	    else{
		if(v[i-1].first.second < v[i].first.second){
		    cout << -v[i-1].second;
		    if(i != v.size()) cout << ',';
		}
		else{
		    cout << -v[i-1].second;
		    if(i != v.size()) cout << '=';
		}
	    }
	}
	cout << endl;
    }
    return 0;
}

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

using namespace std;

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

    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;
    }
    return 0;
}

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

using namespace std;

struct Prob { bool ok;int ngcnt; int time; };
struct Team { int cnt; int time; };

struct Pred{
    bool operator()(const Team& a, const Team& b){
        if(a.cnt==b.cnt) return a.time < b.time;
        else return a.cnt > b.cnt;
    }
};


bool isEq(const Team& a, const Team& b){
    return a.cnt == b.cnt && a.time == b.time;
}

int main()
{
    int M, T, P, R;
    while(cin >> M >> T >> P >> R, M){
        vector<vector<Prob>> ps(T, vector<Prob>(P, {false, 0, 0}));
        
        for(int i=0;i<R;++i){
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            t-=1;p-=1;
            auto& e = ps[t][p];
            if(!j){
                e.ok=true;
                e.time=m;
            }else{
                ++e.ngcnt;
            }
        }
        
        vector<int> tsInt(T, 0);
        vector<Team> ts(T, {0, 0});
        for(int i=0;i<T;++i){
            tsInt[i] = i;
            auto& t = ts[i];
            for(auto& p: ps[i]) if(p.ok){
                ++t.cnt;
                t.time += p.time + p.ngcnt*20;
            }
        }
        
        Pred pred;
        sort(tsInt.begin(), tsInt.end(), [&](int i, int j){ return pred(ts[i], ts[j]); });
        
        vector<vector<int>> merge{};
        int size = 0;
        for(auto& e: tsInt){
            if(merge.size() == 0){
                vector<int> vs(1); vs[0]=e; merge.push_back(vs);
                ++size;
            }
            else{
                if(isEq(ts[merge[size-1][0]], ts[e]))
                    merge[size-1].push_back(e);
                else{
                    vector<int> vs(1); vs[0]=e; merge.push_back(vs);
                    ++size;
                }
            }
        }
        
        for(int i=0;i<size;++i){
            sort(merge[i].begin(), merge[i].end(), greater<int>());
            int s = merge[i].size();
            for(int j=0;j<s;++j){
                cout << merge[i][j]+1;
                if(j==s-1) break;
                cout << "=";
            }
            if(i==size-1) break;
            cout << ",";
        }
        cout << endl;
    }
}