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;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,n1,n2) for(int i=n1;i<n2;i++)
#define speed_up    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

typedef long long int ll;
typedef pair<ll,ll> Pi;
const int INF=(ll)(1LL<<31)-1;
const ll INFl=(ll)9223372036854775807;
const int MAX=10000;
const ll MOD=(ll)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a, b)*b;}
//int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}


int m,t,p,r;
vector<pair<int,pair<int,int> > > vv[55];
typedef struct{
	int num;
	int ans_n;
	int time;
}date_set;

date_set date(int num,int ans_n,int time){
	date_set temp;
	temp.num=num;
	temp.ans_n=ans_n;
	temp.time=time;
	return temp;
}

date_set vre[55];
bool comp(const pair<int,pair<int,int> >& P1,const pair<int,pair<int,int> >& P2){
	return P1.second.second<P2.second.second;
}

bool comp2(const date_set& d1,const date_set& d2){
	if(d1.ans_n!=d2.ans_n){
		return d1.ans_n>d2.ans_n;
	}else if(d1.time!=d2.time){
		return d1.time<d2.time;
	}else{
		return d1.num>d2.num;
	}
}

vector<string> anss;
int main(){
	while(1){
		for(int i=0;i<55;i++){
			vv[i].clear();
			vre[i]={0,0,0};
		}
		cin>>m>>t>>p>>r;
		if(m==0&&t==0&&p==0&&r==0)break;
		for(int i=0;i<r;i++){
			int mm,tt,pp,jj;
			cin>>mm>>tt>>pp>>jj;
			vv[tt].push_back(make_pair(mm,pair<int,int>(pp,jj)));
		}
		vector<int> alr;
		for(int i=1;i<=t;i++){
			alr.clear();
			sort(vv[i].begin(),vv[i].end(),comp);
			int cor=0;
			int time=0;
			for(int j=0;j<vv[i].size();j++){
				if(vv[i][j].second.second==0){
					cor++;
					time+=vv[i][j].first;
					alr.push_back(vv[i][j].second.first);
				}else{
					auto itr=find(alr.begin(),alr.end(),vv[i][j].second.first);
					if(itr!=alr.end()){
						time+=20;
					}
				}
			}
			vre[i-1]=date(i,cor,time);
			
		}
		/*for(int i=0;i<t;i++){
			cout<<vre[i].num<<" "<<vre[i].ans_n<<" "<<vre[i].time<<endl;
		}*/
		sort(vre,vre+t,comp2);
		string st="";
		for(int i=0;i<t-1;i++){
			if(vre[i].ans_n!=vre[i+1].ans_n||vre[i].time!=vre[i+1].time){
				//cout<<vre[i].num<<",";
				st=st+to_string(vre[i].num)+",";
			}else{
				st=st+to_string(vre[i].num)+"=";
				//cout<<vre[i].num<<"=";
			}
		}
		
		st=st+to_string(vre[t-1].num)+"\n";
		//cout<<vre[t-1].num<<endl;
		anss.push_back(st);
	}
	for(int i=0;i<anss.size();i++){
		cout<<anss[i];
	}
	return 0;
}

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

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

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

		int CP[50], TT[50], PT[50][10];		// 正解数，時間計，ペナルティ
		for(int i=0; i<T; i++){
			CP[i] = TT[i] = 0;
			for(int j=0; j<P; j++)
				PT[i][j] = 0;
		}

		for(int i=0; i<R; i++){				// 各チームの正解数，時間計を求める
			int m, t, p, j;
			cin >> m >> t >> p >> j;

			if(j==0){
				CP[t-1]++;
				TT[t-1] += (m+PT[t-1][p-1]);
			}
			else{
				PT[t-1][p-1] += 20;
			}
		}

		int tnow, tpre = -1;				// 今のチーム，1つ前のチーム
		bool flg[50];					// 処理済フラグ
		for(int i=0; i<T; i++)
			flg[i] = false;

		for(int i=0; i<T; i++){
			tnow = -1;
			for(int j=0; j<T; j++){				// 今のチームを求める
				if(flg[j])
					continue;

				if(tnow==-1){
					tnow = j;
				}
				else{
					if(CP[j]>CP[tnow] || (CP[j]==CP[tnow] && TT[j]<=TT[tnow])){
						tnow = j;
					}
				}
			}

			if(tpre!=-1){							// 出力
				if(CP[tnow]==CP[tpre] && TT[tnow]==TT[tpre])
					cout << '=';
				else
					cout << ',';
			}
			cout << tnow+1;

			flg[tnow] = true;
			tpre = tnow;
		}
		cout << endl;
	}

	return 0;
}