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 <utility>
#include <algorithm>
#include <functional>

using namespace std;

int time_memo[51][11];
bool memo[51][11];

int main(void){
  int M, T, P, R;
  int m, t, p, j;
  vector<pair<int, pair<int, int> > > v;

  while(cin >> M >> T >> P >> R, M || T || P || R){
    v.clear();

    for(int i=1; i<=T; i++){
      for(int k=1; k<=P; k++){
        time_memo[i][k] = 0;
        memo[i][k] = false;
      }
    }

    for(int i=0; i<R; i++){
      cin >> m >> t >> p >> j;
      if(j == 0){
        time_memo[t][p] += m;
        memo[t][p] = true;
      } else {
        time_memo[t][p] += 20;
      }
    }

    for(int i=1; i<=T; i++){
      int t = 0, c = 0;
      for(int k=1; k<=P; k++){
        if(memo[i][k] == true){
          ++c;
          t += time_memo[i][k];
        }
      }

      v.push_back(make_pair(c, make_pair(-1 * t, i)));
    }
    sort(v.begin(), v.end(), greater<pair<int, pair<int, int> > >());
    
    cout << v[0].second.second;
    int tbuf = v[0].second.first, mbuf = v[0].first;
    for(int i=1; i<v.size(); i++){
      if(tbuf == v[i].second.first && mbuf == v[i].first){
        cout << "=" << v[i].second.second;
      } else {
        cout << "," << v[i].second.second;
        tbuf = v[i].second.first; mbuf = v[i].first;
      }
    }
    cout << endl;
  }

  return 0;
}

C++: //#include <bits/stdc++.h>
//#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#include<fstream>


#define FOR(i, a, b) for( int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for( int i=(a);i>=(b);i--)
#define LFOR(i, a, b) for( long long int i=(a);i<=(b);i++)
#define LRFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 600000000 //2000000000
#define LINF 1000000000000000000 //9000000000000000000 大きいとワ―シャルフロイドでオーバーフローを起こす
#define PI 3.14159265358979

using namespace std;
typedef long long int ll;
typedef pair< long long int, long long  int> P;

int dy[5] = { 0,0,1,-1,0 };
int dx[5] = { 1,-1,0,0,0 };



int main(void) {

	while (1) {
		int M, T, P, R;

		cin >> M >> T >> P >> R;
		if (M == 0) {
			break;
		}
		int pena[51][11] = {};// ペナルティ回数　iチームのj問題に対する回数
		int ans[51] = {};//正答数
		int time[51] = {};//時間
		int m, t, p, j;

		FOR(i, 1, R) {
			cin >> m >> t >> p >> j;
			if (j == 0) {
				ans[t]++;
				time[t] += m + (pena[t][p] * 20);
			}
			else {
				pena[t][p]++;
			}
		}

		vector< pair< pair<int, int>, int> > pa(T);
		FOR(i, 0, T-1) {
			pa[i].first.first = -ans[i + 1];
			pa[i].first.second = time[i + 1];
			pa[i].second = -(i + 1);
		}

		sort(pa.begin(), pa.end());

		int nowa, nowt;

		FOR(i, 0, T-1) {
			if (i == 0) {
				nowa = pa[i].first.first;
				nowt = pa[i].first.second;
				cout << -pa[i].second;
			}
			else {
				if (pa[i].first.first == nowa && pa[i].first.second == nowt) {
					cout << "=" << -pa[i].second;
				}
				else {
					cout << "," << -pa[i].second;
					nowa = pa[i].first.first;
					nowt = pa[i].first.second;
				}
			}
		}
		cout << endl;
		
	}

	return 0;
}

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

int main(){
	while(1){
		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;
		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[tpre]==TT[tnow]){
					cout<<'=';
				}
				else{
					cout<<'.';
				}
			}
			cout<<tnow+1;
		
			flg[tnow]=true;
			tpre=tnow;
		}
		cout<<endl;
	}
	
	return 0;
}