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 <map>

using namespace std; 

int main()
{
	int M, T, P, R;
	int m, t, p, j;
	int pena[51][11];
	int solve[51];
	int time[51];

	while(cin >> M >> T >> P >> R){
		if(M==0 && T==0 && P==0 && R==0){return 0;}

		map<int,map<int,map<int,int,greater<int> > >,greater<int> > ans;

		for(int i=1; i<=T; i++){
				solve[i]=0;
				time[i]=0;
			for(int k=1; k<=P; k++){
				pena[i][k]=0;
			}
		}

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

			if(j==0){
				solve[t]++;
				time[t] = time[t] + m + 20*pena[t][p];
			}
			else{
				pena[t][p]++;
			}
		}

		for(int i=1; i<=T; i++){
			ans[solve[i]][time[i]][i]=0;
		}

		int pre_s=-1, pre_t=-1;

		for(map<int,map<int,map<int,int,greater<int> > >,greater<int> >::iterator it = ans.begin(); it != ans.end(); it++){
			for(map<int,map<int,int,greater<int> > >::iterator jt = (*it).second.begin(); jt != (*it).second.end(); jt++){
				for(map<int,int,greater<int> >::iterator kt = (*jt).second.begin(); kt != (*jt).second.end(); kt++){
					if(pre_s==-1 && pre_t==-1){ cout << (*kt).first; }
					else if(pre_s==(*it).first && pre_t==(*jt).first){cout << "=" << (*kt).first;}
					else{cout << "," << (*kt).first;}
					pre_s=(*it).first;
					pre_t=(*jt).first;
				}
			}
		}
		cout << endl;
	}
}

C++: #include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)

using namespace std;

struct Team{
    int solve;
    int time;
    int id;
    vector<int> wa;
    vector<bool> solved;
    Team(int P){
        solve = time = 0;
        solved.resize(P);
        wa.resize(P);
    }
    bool operator < (const Team& t) const {
        if(solve != t.solve) return solve > t.solve;
        if(time != t.time)  return time < t.time;
        return id > t.id;
    }
};

int main(){
    int M, T, P, R;
    while(cin >> M >> T >> P >> R && M > 0) {
        vector<Team> teams(T, Team(P));
        REP(i, T) teams[i].id = i + 1;

        REP(i, R) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            t--;
            p--;
            if(j == 0) {
                if(teams[t].solved[p]) continue;
                teams[t].solved[p] = true;
                teams[t].time += 20 * teams[t].wa[p] + m;
                teams[t].solve += 1;
            } else {
                teams[t].wa[p] += 1;
            }
        }

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

        for(int i = 0; i < T; i++) {
            if(i > 0) {
                if(teams[i - 1].solve == teams[i].solve && teams[i - 1].time == teams[i].time) {
                    cout << "=";
                } else {
                    cout << ",";
                }
            }
            cout << teams[i].id;
        }
        cout << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 29;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };


int main() {
	int m, t, p, r;
	vector<pair<PII, int> > _team;
	map<PII, int> ma;
	while ( ~scanf( "%d %d %d %d", &m, &t, &p, &r ) && m && t && p ) {
		_team.resize( t );
		for ( int i = 0; i < t; i++ ) {
			_team[ i ] = make_pair( PII( 0, 0 ), i + 1 );
		}
		for ( int i = 0; i < r; i++ ) {
			int tid, pid, time, j;
			scanf( "%d %d %d %d", &time, &tid, &pid, &j );
			if ( j ) {
				ma[ PII( tid, pid ) ]++;
			}
			else {
				_team[ tid - 1 ].first.first++;
				_team[ tid - 1 ].first.second -= time + ma[ PII( tid, pid ) ] * 20;
			}
		}
		sort( _team.rbegin(), _team.rend() );
		for ( int i = 0; i < t - 1; i++ ) {
			printf( "%d", _team[ i ].second );
			if ( _team[ i ].first == _team[ i + 1 ].first ) {
				printf( "=" );
			}
			else {
				printf( "," );
			}
		}
		printf( "%d\n", _team[ t - 1 ].second );
		ma.clear();
	}
	return 0;
}