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<string.h>

using namespace std;

struct TeamData{
	int cn;
	int pnp;
	int pn[10];
};

struct ansData{
	int tn;
	int same;
};

vector<vector<ansData> > ans;

int main(){
	while(1){
		int M,T,P,R;
		cin >> M >> T >> P >> R;
		if(M+T+P+R == 0) break;
		TeamData td[50];
		
		memset(td,0,sizeof(td));
		
		for(int i = 0;i < R;i++){
			int m,t,p,j;
			cin >> m >> t >> p >> j;
			if(j == 0){
				td[t - 1].cn++;
				td[t - 1].pnp += td[t - 1].pn[p - 1] * 20 + m;
			}else{
				td[t - 1].pn[p - 1]++;
			}
		}
		
		
		int index[50];
		for(int i = 0;i < 50;i++) index[i] = i;
		
		for(int i = 0;i < T;i++){
			int now = index[i];
			for(int j = T-1;j > i;j--){
				int target = index[j];
				if(td[now].cn < td[target].cn){
					index[i] = target;
					index[j] = now;
					now = target;
				}else if(td[now].cn == td[target].cn){
					if(td[now].pnp > td[target].pnp){
						index[i] = target;
						index[j] = now;
						now = target;
					}else if(td[now].pnp == td[target].pnp){
						if(now < target){
							index[i] = target;
							index[j] = now;
							now = target;
						}
					}
				}
			}
		}

		vector<ansData> tans;
		
		for(int i=0;i<T;i++){
			ansData ad;
			ad.tn = index[i]+1;
			if(i == 0){
				ad.same = 0;
			}else{
				if((td[index[i]].cn == td[index[i-1]].cn) && (td[index[i]].pnp == td[index[i-1]].pnp)){
					ad.same = 1;
				}else ad.same = 0;
			}
			cout << ad.same;
			tans.push_back(ad);
		}
		cout << endl;
		ans.push_back(tans);
	}
	for(int i = 0;i < ans.size();i++){
		for(int j = 0;j < ans[i].size();j++){
			if(j == 0){
				cout << ans[i][j].tn;
			}else{
				if(ans[i][j].same == 0){
					cout << "," << ans[i][j].tn;
				}else{
					cout << "=" << ans[i][j].tn;
				}
			}
		}cout << endl;
	}
	
	return 0;
}

C++: #include <iostream>
#include<bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P> PP;
vector<PP> v;
int dp[51][11][2],A,B,C,D,a,b,c,d,T[51];
int main(void){
    while(1){
    cin>>A>>B>>C>>D;
    if(A==0)return 0;
    for(int i=0;i<51;i++)for(int j=0;j<11;j++)for(int k=0;k<2;k++)dp[i][j][k]=0;
    for(int i=0;i<51;i++)T[i]=0;
    v={};
    for(int i=0;i<D;i++){
        cin>>a>>b>>c>>d;
        if(d!=0)dp[b][c][0]++;
        else{
            T[b]+=dp[b][c][0]*20;
            dp[b][c][1]=a+1;
        }
    }
    for(int i=1;i<=B;i++){
        int L=0,cnt=0;
        for(int j=1;j<=C;j++){
            if(dp[i][j][1])cnt++;
            L+=dp[i][j][1]-1;
        }
        L+=T[i];
        v.push_back({-cnt,{L,-i}});
    }
    sort(v.begin(),v.end());
    a=v[0].F,b=v[0].S.F,c=v[0].S.S;
    cout<<-c;
    for(int i=1;i<v.size();i++){
        if(a==v[i].F&&b==v[i].S.F)cout<<"=";
        else cout<<",";
        cout<<-v[i].S.S;
        a=v[i].F,b=v[i].S.F,c=v[i].S.S;
    }
    cout<<endl;
    }
}

C++: #include<iostream>
#include<algorithm>
using namespace std;

struct data{
  int ac,pe,id;
  bool operator == (const data& p) const{
    return ac==p.ac && pe==p.pe;
  }
  bool operator < (const data& p) const{
    if(ac!=p.ac)return ac>p.ac;
    if(pe!=p.pe)return pe<p.pe;
    return id>p.id;
  }
};

int wa_cnt[51][11];

data team[51];

void init();

int main(){
  int M,T,P,R;
  while(1){
    cin>>M>>T>>P>>R;
    if(M==0&&T==0&&P==0&&R==0)break;
    init();
    for(int i=0;i<R;i++){
      int m,t,p,j;
      cin>>m>>t>>p>>j;t--;
      if(m>M)continue;
      if(j==0){
	team[t].ac++;
	team[t].pe+=(wa_cnt[t][p]*20);	
	team[t].pe+=m;
      }else wa_cnt[t][p]++;
    }

    sort(team,team+T);
    for(int i=0;i<T;i++){
      if(i>0)cout<<(team[i-1]==team[i]?'=':',');
      cout<<team[i].id;
    }
    cout<<endl;
  }
  return 0;
}

void init(){
  for(int i=0;i<51;i++)for(int j=0;j<11;j++)wa_cnt[i][j]=0;
  for(int i=0;i<51;i++){
    team[i].id=i+1;
    team[i].pe=team[i].ac=0;
  }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct team{
	int t, c, m;
	int p[10];
};

bool operator<(const team team1, const team team2){
	bool rep;
	if(team1.c == team2.c){
		rep = (team1.m == team2.m) ? team1.t > team2.t : team1.m < team2.m;
	}else{
		rep = (team1.c > team2.c);
	}
	return rep;
}

int main(){
	int M, T, P, R;
	while( cin >> M >> T >> P >> R, M || T || P || R ){
		vector<team> teams(T);
		for(int i = 0; i < T; i++){
			teams[i].t = i+1;
			teams[i].c = 0;
			teams[i].m = 0;
		}
		for(int i = 0; i < R; i++){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if( j == 0 ){
				teams[t-1].c++;
				teams[t-1].m += (m + 20 * teams[t-1].p[p-1]);
			}else{
				teams[t-1].p[p-1]++;
			}
		}
		sort(teams.begin(), teams.end());
		cout << teams[0].t;
		for(int i = 1; i < T; i++){
			if( teams[i].c == teams[i-1].c && teams[i].m == teams[i-1].m ) cout << "=";
			else cout << ",";
			cout << teams[i].t;
		}
		cout << endl;
	}
}