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>
#include <vector>
static const int N = 2001;
using namespace std;
struct data{
  int correctcnt,time,tnum;
  bool operator<(const data& right)const{
    if(correctcnt!=right.correctcnt) return correctcnt>right.correctcnt;
    if(time!=right.time) return time<right.time;
    return tnum>right.tnum;
  }
};
int main(){
  int M,T,P,R,i,j,m[N],t[N],p[N],in_j[N],incorrectcnt;
  while(1){
    cin >> M >> T >> P >> R;
    vector<data> V(T);
    if(M==0&&T==0&&P==0&&R==0) break;
    for(i=0;i<R;i++){
      cin >> m[i] >> t[i] >> p[i] >> in_j[i];
    }
    for(i=0;i<T;i++){
      V[i].tnum=i;
      V[i].correctcnt=V[i].time=0;
    }
    for(i=0;i<R;i++){
      if(in_j[i]==0){
	V[t[i]-1].correctcnt++;
	incorrectcnt=0;
	for(j=0;j<i;j++){
	  if(t[i]==t[j]&&p[i]==p[j]) incorrectcnt++;
	}
	V[t[i]-1].time+=m[i]+20*incorrectcnt;
      }
    }
    sort(V.begin(),V.end());
    for(i=0;i<T-1;i++){
      cout << V[i].tnum+1;
      if(V[i].correctcnt==V[i+1].correctcnt&&V[i].time==V[i+1].time) cout << '=';
      else cout << ',';
    }
    cout << V[T-1].tnum+1 << endl;
  }  
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

struct Team{
    int solved, penalty, num;
    bool operator<(const Team &obj)const{
        if(solved == obj.solved && penalty != obj.penalty)return penalty > obj.penalty;
        if(solved != obj.solved)return solved < obj.solved;
        return num < obj.num;
    }
    bool operator==(const Team &obj)const{
        return solved == obj.solved && penalty == obj.penalty;
    }
};

int penalty[52][12]={0};

void init(){
    for(int i=0;i<=50;++i){
        for(int j=0;j<=10;++j){
            penalty[i][j] = 0;
        }
    }
}

int main(){
    int m, t, p, r;
    while(cin >> m >> t >> p >> r, m != 0){
        init();
        vector<Team> v(t);
        for(int i=0;i<t;++i)v[i].num = i+1;
        for(int i=0;i<r;++i){
            int mi, ti, pi, ji;
            cin >> mi >> ti >> pi >> ji;
            if(ji == 0){
                v[ti-1].solved++;
                v[ti-1].penalty += mi + (penalty[ti-1][pi-1]*20);
            }else{
                penalty[ti-1][pi-1]++;
            }
        }
        sort(v.rbegin(), v.rend());
        for(int i=0;i<t;++i){
            if(i){
                if(v[i] == v[i-1])cout << "=";
                else cout << ",";
            }
            cout << v[i].num;
        }
        cout << endl;
    }

    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<functional>
#include<queue>
#include<algorithm>
#include<complex>
#include<cstdlib>
#include<cctype>

#define REP(i,n) for(int i = 0;i < (n);i++)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int i = 0;i < (n);i++)cout << v[i] << ' ';cout << endl << endl;}
#define SHOW2d(v,i,j) {for(int a = 0;a < i;a++){for(int b = 0;b < j;b++)cout << v[a][b] << ' ';cout << endl;}cout << endl;}
#define ALL(v) v.begin(),v.end()

using namespace std;

typedef long long ll;
typedef vector<int> iv;
typedef vector<iv> iiv;
typedef vector<string> sv;

struct score
{
	int team,pro,wrong[11];
	ll _time;
	
	score(int n){team = n;pro = 0;_time = 0;REP(i,11)wrong[i] = 0;}
	
	bool operator<(const score& right) const
	{
		return pro != right.pro ? pro > right.pro :
		_time != right._time ? _time < right._time : team > right.team ;
	}
};


int main()
{
	int m,t,p,r;
	
	while(cin>>m>>t>>p>>r,m|t|p|r)
	{
		vector<score> v;
		REP(i,t)
		{
			score tmp(i);
			v.PB(tmp);
		}
		
		
		REP(i,r)
		{
			int mm,tt,pp,jj;
			cin>>mm>>tt>>pp>>jj;
			if(!jj)
			{
				v[tt-1].pro++;
				v[tt-1]._time+=mm+20*v[tt-1].wrong[pp];
			}
			else
			{
				v[tt-1].wrong[pp]++;
			}
		}
		
		sort(ALL(v));
//		REP(i,t)
//		{
//			cout << v[i].team << ' ' << v[i].pro << ' ' << v[i]._time << endl;
//		}
		
		cout << v[0].team+1 ;
		for(int i = 1;i < t;i++)
		{
			if(v[i].pro == v[i-1].pro && v[i]._time == v[i-1]._time)
			{
				cout << '=' << v[i].team+1;
			}
			else
			{
				cout << ',' << v[i].team+1;
			}
		}
		cout << endl;
	}
		
	return 0;
}

C++: 
	int M, T, P, R;
	cin >> M >> T >> P >> R;

	vector<Team> teams(T, Team(P));

	for (int i = 0; i < T; ++i) {
		teams[i].num = i + 1;
	}

	for (int i = 0; i < R; ++i) {
		int m, t, p, j;
		cin >> m >> t >> p >> j;

		// judge is incorrect.
		if (j != 0) {
			teams[t - 1].incorrects[p - 1]++;
			continue;
		}

		// judge is correct.
		teams[t - 1].corrects[p - 1] = 1;

		int time = m + teams[t - 1].incorrects[p - 1] * 20;
		teams[t - 1].time = time;
	}

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

	int time = 0;
	for (int i = 0; i < teams.size(); ++i) {
		auto&& t = teams[i];
		
		int c = count(t.corrects.begin(), t.corrects.end(), 1);
		

		if (i == teams.size() - 1) {
			cout << t.num << endl;
			break;
		}

		auto&& nt = teams[i + 1];

		int nc = count(nt.corrects.begin(), nt.corrects.end(), 1);

		if (c == nc && nt.time == t.time) {
			cout << t.num << '=';
		}
		else {
			cout << t.num << ',';
		}
	}