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 <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitset>
#define INF 2000000000
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
#define ll long long
#define PL pair<long long, long long>
#define PR pair<int,int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;
#define int ll

//ICPC Ranking  AOJ

#define MAX 60
int tt[55];
int pena[55][15];
int point[55];
bool done[MAX];

signed main(){
  int M,T,P,R;
  while(cin>>M>>T>>P>>R&&!(M==0&&T==0&&P==0&&R==0)){
    for(int i=0; i<=55; i++){
      for(int j=0; j<=15; j++){
        pena[i][j]=0;
      }
      tt[i]=0;
      point[i]=0;
      done[i]=false;
    }
    
    for(int i=0; i<R; i++){
      int m,t,p,j;
      cin>>m>>t>>p>>j;
      if(j){
        pena[t][p]++;
      }else{
        tt[t]+=m;
        tt[t]+=pena[t][p]*20;
        point[t]++;
      }
    }
    
    PR pre;
    for(int i=1; i<=T; i++){
      int m=0,t=0;
      int nowt=0;
      for(int j=1; j<=T; j++){
        if(done[j]) continue;
        if(point[j]>m){
          nowt=j;
          m=point[j];
          t=tt[j];
        }else if(point[j]==m){
          if(tt[j]<=t){
            nowt=j;
            m=point[j];
            t=tt[j];
          }
        }
      }
      
      done[nowt]=true;
      if(i==1) cout<<nowt;
      else{
        if(pre.first==m&&pre.second==t){
          cout<<'='<<nowt;
        }else{
          cout<<','<<nowt;
        }
      }
      
      pre.first=m; pre.second=t;
    }
    cout<<en
  }
  RE
}

C++: #include<iostream>
#include<algorithm>

using namespace std;

class team
{
public:
	int number;
	int alltime;
	int acnum;
	int wa[11];
	team(){}
	bool operator<(const team &t)const
	{
		return acnum==t.acnum?alltime==t.alltime?number>t.number:alltime<t.alltime:acnum>t.acnum;
	}
	bool operator==(const team &t)const
	{
		return acnum==t.acnum&&alltime==t.alltime;
	}
};

int main()
{
	int m,t,p,r;
	while(1)
	{
		cin>>m>>t>>p>>r;
		if(!(m||t||p||r))break;
		team te[50];
		for(int i=0;i<t;i++)
		{
			te[i]=team();
			te[i].number=i;
		}
		int a,b,c,d;
		for(int i=0;i<r;i++)
		{
			cin>>a>>b>>c>>d;
			if(d!=0)te[--b].wa[c]++;
			else
			{
				b--;
				te[b].acnum++;
				te[b].alltime+=a+20*te[b].wa[c];
			}
		}
		sort(te,te+t);
		for(int i=0;i<t;i++)
		{
			if(i)
			{
				if(te[i-1]==te[i])cout<<"=";
				else cout<<",";
			}
			cout<<te[i].number+1;
		}
		cout<<endl;
	}
	return 0;
}

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

struct team{
	int n, c, t, p;
};

bool operator<(const team team1, const team team2){
	bool rep;
	if(team1.c == team2.c){
		rep = (team1.t == team2.t) ? team1.n > team2.n : team1.t < team2.t;
	}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].n = i+1;
			teams[i].c = 0;
			teams[i].t = 0;
			teams[i].p = 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].t = m + 20 * teams[t-1].p;
			}else{
				teams[t-1].p++;
			}
		}
		sort(teams.begin(), teams.end());
		cout << teams[0].n;
		for(int i = 1; i < T; i++){
			if( teams[i].c == teams[i-1].c && teams[i].t == teams[i-1].t ) cout << "=";
			else cout << ",";
			cout << teams[i].n;
		}
		cout << endl;
	}
}

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;
        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;
}