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<bool> > end(T, vector<bool>(P, false) );
		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]) continue;
			if (m >= M) continue;
			if (j==0) {
				pv[t-1].first++;
				pv[t-1].second.first -= m;
				end[t-1][p-1] = true;
			} else {
				pv[t-1].second.first -= 20;
			}
		}

		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<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;
				}
			}
			tans.push_back(ad);
		}
		
		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 <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<(int)N;i++)
#define ck(n,a,b) ((a)<=(n)&&(n)<(b))
#define p(s) cout<<(s)<<endl
#define F first
#define S second
typedef long long ll;
using namespace std;

int main() {
	int M, T, P, R;
	while(cin>>M>>T>>P>>R, M||T||P||R){
		int pena[51][11];
		REP(i,0,51) REP(j,0,11) pena[i][j]=0;
//int ok[51][11]={};
//int alltime[51]={};
		pair<int,pair<int,int>> allt[51];
		REP(i,0,51) allt[i]={0,{0,-i-1}};
		//pair<int,int> prob[51];
		//REP(i,0,T) prob[i]={0,-i-1};//p,team
		REP(i, 0, R){
			int m, t, p, j;
			cin>>m>>t>>p>>j;
			t--;
			p--;
			if(j!=0){
				pena[t][p]++;
			}
			else if(j==0){
				allt[t].S.F+=(pena[t][p]*20 + m);
				allt[t].F--;
			}
		}
/*		REP(i, 0, T){
			REP(j, 0, P){
				allt[i].F+=ok[i][j];
			}
		}
*/
		sort(allt, allt+T);
		cout<<-allt[0].S.S;
		REP(i, 1, T){
			if(allt[i-1].F==allt[i].F && allt[i-1].S.F==allt[i].S.F){
				cout<<"="<<-allt[i].S.S;
			}
			else{
				cout<<","<<-allt[i].S.S;
			}
		}
		cout<<endl;
	}
	return 0;
}