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 <string>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>

using namespace std;

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)


#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define INF 1<<30
#define mp make_pair
#define pb push_back

#define fi first
#define se second

#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)

typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pii;

typedef long long ll;

class team{
public:
	int id;
	int clear;
	vi fail;
	int time;
	team(){
		id=0;
		clear=0;
		fail = vi(10,0);
		time=0;
	}
};

int main(){
	while(1){
		int M,T,P,R;
		int m,t,p,j;
		vector<team> tev;
		vector<pii> ap; 
		cin>>M>>T>>P>>R;
		if(M==0)break;
		rep(i,T){
			team te;
			te.id=i+1;
			te.clear=0;
			te.time=0;
			tev.pb(te);
			//????????§id??????????????°??????????????????clear,time???0??§?????????
		}
		rep(i,R){
			cin>>m>>t>>p>>j;
			if(j==0){
				int time=m;
				//????????§?????£?§£??°????????????????????????????????£?§£??°??¨????????????????????????
				time += tev[t-1].fail[p]*20;
				tev[t-1].clear++;
				tev[t-1].time+=time;
			}else{
				//????????§???????????????????????¨????????£?§£?????°?????????
				tev[t-1].fail[p]++;
			}
		}
		rep(i,T){
			ap.pb(mp(tev[i].clear*100000+(90000-tev[i].time),tev[i].id));
		}
		sort(rall(ap));

		cout<<ap[0].se;
		REP(i,1,T){
			if(ap[i-1].fi==ap[i].fi) cout<<"=";
			else cout<<",";
			cout<<ap[i].se;
		}
		cout<<endl;
		// rep(i,T){
		// 	cout<<"debug clear:"<<tev[i].clear<<" time:"<<tev[i].time;
		// 	cout<<endl;
		// 	rep(j,P){
		// 		cout<<" fail:"<<tev[i].fail[j];
		// 	}
		// 	cout<<endl;
		// }

	}
	return 0;
}

C++: #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
struct data{
    int ac,all_time,n;
    data(int a,int b,int c):ac(a),all_time(b),n(c){}
    data(){}
    bool operator<(const data &d)const{
        return ac<d.ac||(ac==d.ac&&all_time>d.all_time);
    }
};
int main(){
    int M,T,P,R;
    while(scanf("%d%d%d%d",&M,&T,&P,&R),M||T||P||R){
        int wa[50][10];
        vector<data>V(T);
        for(int i=0;i<T;i++)V[i]=data(0,0,i+1);
        fill_n(*wa,500,0);
        while(R--){
            int m,t,p,j;
            scanf("%d%d%d%d",&m,&t,&p,&j);
            if(j){
                t--;p--;
                wa[t][p]++;
            }
            else{
                t--;p--;
                V[t].ac++;
                V[t].all_time+=m+wa[t][p]*20;
            }
        }
        sort(V.begin(),V.end());
        reverse(V.begin(),V.end());
        printf("%d",V[0].n);
        for(int i=1;i<T;i++){
            if(V[i].ac==V[i-1].ac&&V[i].all_time==V[i-1].all_time){
                printf("=");
            }
            else{
                printf(",");
            }
            printf("%d",V[i].n);
        }
        puts("");
    }
}

C++: #include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
typedef pair<int,int> pi;
typedef pair<pi,int> ppii;
#define F first
#define S second
#define PB push_back
const int N=1e2+10;
bool cmp(ppii a,ppii b){
    if(a.F.F==b.F.F){
        if(a.F.S==b.F.S)return a.S>b.S;
        return a.F.S<b.F.S;
    }
    return a.F.F>b.F.F;
}
int main(){
    int m,t,p,q,a,b,c,d,add[N][N];
    ppii ans[N];
    while(true){
        scanf("%d%d%d%d",&m,&t,&p,&q);
        if(m==0&&q==0&&t==0&&p==0)return 0;
        for(int i=1;i<=t;i++)for(int j=1;j<=q;j++)add[i][j]=0;
        for(int i=1;i<=t;i++)ans[i]={{0,0},i};
        while(q--){
            scanf("%d%d%d%d",&a,&b,&c,&d);
            if(d==1)add[b][c]+=20;
            else {
                ans[b].F.S+=add[b][c]+a;
                ans[b].F.F++;
            }
        }
        sort(ans+1,ans+1+t,cmp);
        printf("%d",ans[1].S);
        for(int i=2;i<=t;i++){
            if(ans[i].F==ans[i-1].F)printf("=");
            else printf(",");
            printf("%d",ans[i].S);
        }
        printf("\n");    
    }
}