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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
int sum[55];
int penalty[55][15];
int accepted[55];

int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    while(true) {
        int M, T, P, R;
        cin >> M >> T >> P >> R;
        if(M == 0) break;
        for(int i = 0; i <= T; i++) {
            sum[i] = 0;
            accepted[i] = 0;
            for(int j = 0; j <= 10; j++) penalty[i][j] = 0;
        }
        while(R--) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            if(j != 0) {
                penalty[t][p]++;
            } else {
                accepted[t]++;
                sum[t] += m + 20 * penalty[t][p];
            }
        }
        vector<i_i> ans;
        for(int i = 1; i <= T; i++) {
            ans.push_back({accepted[i] * 1e7 - sum[i], i});
        }
        sort(ans.begin(), ans.end(), greater<i_i>());
        cout << ans[0].second;
        for(int i = 1; i < ans.size(); i++) {
            if(ans[i].first == ans[i-1].first) {
                cout << "=" << ans[i].second;
            } else cout << "," << ans[i].second;
        }
        cout << endl;
    }
    return 0;
}

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

using namespace std;

int M,T,P,R;
int m[2000],t[2000],p[2000],j[2000];
struct team{
	int n,s,t,w[2000];
};

bool comp(const team &t1,const team &t2){
	if(t1.t==t2.t && t1.s==t2.s)return t1.n>t2.n;
	if(t1.s==t2.s)return t1.t<t2.t;
	return t1.s>t2.s;
};

team dat[2001];

int main(void){
	while(1){
		scanf("%d%d%d%d",&M,&T,&P,&R);
		if(M+T+R+P==0)break;
		memset(dat,0,sizeof(dat));
		for(int i=0;i<T;i++)dat[i].n=i+1;
		for(int i=0;i<R;i++){
			scanf("%d%d%d%d",&m[i],&t[i],&p[i],&j[i]);
			if(j[i]!=0){
				dat[t[i]-1].w[p[i]]++;
			}else{
				dat[t[i]-1].s++;
				dat[t[i]-1].t+=m[i]+dat[t[i]-1].w[p[i]]*20;
			}
		}
		sort(dat,dat+T,comp);
		printf("%d",dat[0].n);
		for(int i=1;i<T;i++){
			if(dat[i-1].s==dat[i].s && dat[i-1].t==dat[i].t)printf("=");
			else printf(",");
			printf("%d",dat[i].n);
		}
		printf("\n");
	}
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define INF 1e9

int MOD=1e9+7;

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

    while(1){
        int m,t,p,r;
        cin>>m>>t>>p>>r;

        if(m==0)break;

        vector<pair<pair<int,int>,int>> v(t);
        vector<int> wa(t);
        for(int i=0;i<t;i++){
            v[i].second=i+1;
        }

        for(int i=0;i<r;i++){
            int a,b,c,d;
            cin>>a>>b>>c>>d;
            b--;

            if(d!=0)wa[b]++;
            else{
                v[b].first.first++;
                v[b].first.second+=a+wa[b]*20;
            }
        }
        for(int i=0;i<t;i++){
            v[i].first.second*=-1;
        }
        sort(v.begin(),v.end());
        reverse(v.begin(),v.end());
        for(int i=0;i<t;i++){
            cout<<v[i].second;
            if(i==t-1)cout<<endl;
            else if(v[i].first==v[i+1].first)cout<<"=";
            else cout<<",";
        }
    }
}

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

bool comp(pair<pair<int,int>,int> p1, pair<pair<int,int>,int> p2){

    if(p1.first.first == p2.first.first){
        if(p1.first.second == p2.first.second){
            return p1.second < p2.second;
        }
        return p1.first.second > p2.first.second;
    }
    return p1.first.first < p2.first.first;

}

int main() {

    while(1) {

        int M,T,P,R;

        cin >> M >> T >> P >> R;

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

        pair<int,int> team[T+1]; //solve_num, time
        int wrong_progrums[T+1][P+1]; //wrong_count

        team[0] = make_pair(-1,-1);

        for(int i=1; i<T+1; i++){
            team[i] = make_pair(0,0);
            for(int j=0; j<P+1; j++) {
                wrong_progrums[i][j] = 0;
            }
        }

        for(int i=0; i<R; i++){

            int m, t, p, j;

            cin >> m >> t >> p >> j;

            if(j == 0){
                team[t].first++;
                team[t].second += m + wrong_progrums[t][p] * 20;
            }
            else{
                wrong_progrums[t][p]++;
            }
        }

        pair<pair<int,int>,int> team_result[T+1];

        for(int i=0; i<T+1; i++){
            team_result[i].first.first = team[i].first;
            team_result[i].first.second = team[i].second;
            team_result[i].second = i;
        }

        sort(team_result,team_result+T+1,comp);
        
        cout << team_result[T].second;

        for(int i=T; i>1; i--){
            if(team_result[i].first.first == team_result[i-1].first.first && team_result[i].first.second == team_result[i-1].first.second){
                cout << '=' << team_result[i-1].second;
            }
            else{
                cout << ',' << team_result[i-1].second;
            }
        }

        cout << endl;

    }
    return 0;
}