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 <algorithm>
using namespace std;

struct d{
  int time, prob, team;
};
bool operator<(const d &a, const d &b){
  if(a.prob == b.prob)
  {
    if(a.time == b.time)
    {
      return a.team > b.team;
    }
    return a.time < b.time;
  }
  return a.prob > b.prob;
}
int main(){

  int M, T, P, R;
  int m, t, p, j, i;

  while(cin >> M >> T >> P >> R, M+T+P+R){
    d res[T+1];
    for(i = 1; i <= T; i++){
      res[i].time = res[i].prob = 0;
      res[i].team = i;
    }
    int rank[T+1][P+1];
    for(i = 1; i <= T; i++){
      for(j = 1; j <= P; j++){
        rank[i][j] = 0;
      }
    }
    for(i = 0; i < R; i++){
      cin >> m >> t >> p >> j;
      if(m > M) break;
      if(j){
        rank[t][p]++;
      }else{
        res[t].time += m + rank[t][p]*20;
        res[t].prob++;
      }
    }
    /* cerr << "debug" << endl;
    for(i=1; i<=T; i++)
    {
      cerr << res[i].team << "," << res[i].prob << "," << res[i].time << endl;
    }
    cerr << "debug" << endl;
*/
    sort(res+1, res+T+1);
    cout << res[1].team;
    for(i=2; i<=T; i++)
    {
      cout << ((res[i].prob==res[i-1].prob && res[i].time==res[i-1].time) ? "=" : ",") << res[i].team;
    }
    cout << endl;
    //cerr << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
#define MAX 50
#define MP 11
using namespace std;

struct team{
	int id;
	int problems;
	int time;
	int pm[MP];
	int ep[MP];
};

bool mycomp(const team &t1,const team &t2)
{
	if(t1.problems==t2.problems)return t1.time<t2.time;
	return t1.problems>t2.problems;
}

int M,T,P,R;
team teams[MAX];

void solve()
{
	for(int i=0;i<T;i++)
	{
		teams[i].id=i+1;
		for(int j=1;j<=P;j++)
		{
			if(teams[i].ep[j]==0)continue;
			else teams[i].time+=teams[i].ep[j]+teams[i].pm[j];
		}
	}
	sort(teams,teams+P,mycomp);
	cout<<teams[0].id;
	for(int i=1;i<T;i++)
	{
		if(teams[i].problems==teams[i-1].problems&&teams[i].time==teams[i-1].time)
		{
			cout<<"=";
		}else
		{
			cout<<",";
		}
		cout<<teams[i].id;
	}
	cout<<endl;	
}

void input()
{
	int m,t,p,j;
	while(scanf("%d%d%d%d",&M,&T,&P,&R))
	{
		if(M==0&&T==0&&P==0&&R==0)break;
		memset(teams,0,sizeof(teams));
		for(int i=0;i<R;i++)
		{
			scanf("%d%d%d%d",&m,&t,&p,&j);
			if(j==0)
			{
				teams[t-1].problems++;
				teams[t-1].ep[p]=m;
			}
			else
			{
				teams[t-1].pm[p]+=20;
			}
		}
		solve();
	}
}

int main()
{
	input();
	return 0;
}

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

using namespace std;

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

    int m, t, p, j;
    int result[T];
    fill(result, result + T, 0);
    int time [T];
    fill(time, time + T, 0);
    int failure[T];
    fill(failure, failure + T, 0);
    for(int submit = 0; submit < R; submit++) {
            cin >> m >> t >> p >> j;
            if(j==0) {
                result[t-1] += 1;
                time[t-1] += m + failure[t-1] * 20;
            } else {
                ++failure[t-1];
            }
    }

    bool done[T];
    fill(done, done + T, false);
    int prevPoint, prevTime;
    for(int count = 0; count < T; count++) {
        int maxPoint = -1;
        int maxTeam = 0;
        int minTime = 100000;
        for (int i = T-1; i >= 0; i--) {
            if (done[i]) continue;
            if (maxPoint < result[i]) {
                maxPoint = result[i];
                maxTeam = i + 1;
                minTime = time[i];
            } else if (maxPoint == result[i]) {
                if (minTime > time[i]) {
                    minTime = time[i];
                    maxTeam = i + 1;
                }
            }
        }
        minTime = time[maxTeam-1];
        if(count != 0){
            if(maxPoint == prevPoint && minTime == prevTime) cout << "=";
            else cout << ",";
        }
        cout << maxTeam;
        done[maxTeam-1] = true;
        prevPoint = maxPoint;
        prevTime = minTime;
    }
    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 20000

struct Time{
	int slovenum;
	int time;
	int pos;
}Ttime[55];
int cmp(Time a,Time b){
	if(a.slovenum==b.slovenum){
		if(a.time==b.time){
			return a.pos>b.pos;	
		}
		return a.time<b.time;
	}
	return a.slovenum>b.slovenum;
}
int M,T,P,R;
int Tn[55],Pn[15];
int Hashtime[55][15];
bool isslove[55][15];
int main(){
#ifdef CDZSC
	freopen("Text.txt","r",stdin);
#endif
	ios::sync_with_stdio(false);
	cin.tie(0);
	int m,t,p,r;
	while(cin>>M>>T>>P>>R&&M+R+P+T!=0){
		memset(Hashtime,0,sizeof(Hashtime));
		memset(Ttime,0,sizeof(Ttime));
		for(int i=0;i<=T;i++){
			Ttime[i].pos=i;
		}
		for(int i=0;i<R;i++){
			cin>>m>>t>>p>>r;
			if(r==0){
				Hashtime[t][p]+=m;	
				Ttime[t].time+=Hashtime[t][p];
				Ttime[t].slovenum++;
			}
			else
				Hashtime[t][p]+=20;
		}
		sort(Ttime,Ttime+T+1,cmp);
		for(int i=0;i<T;i++){
			if(i>0){
				if(Ttime[i].time==Ttime[i-1].time&&Ttime[i].slovenum==Ttime[i-1].slovenum)
					printf("=");
				else printf(",");
			}
			printf("%d",Ttime[i].pos);
		}
		cout<<endl;
	}
	return 0;
}