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 "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(i, (v).size()) { cout << v[i]; if (i != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

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


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	while (1) {
		int M, T, P, R;
		cin >> M >> T >> P >> R;
		if (!M)break;
		vector<vector<bool>> ac(T, vector<bool>(P, false));
		vvi pen(T, vi(P, 0));
		vvi last(T, vi(P, 0));
		REP(i, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if (j == 0) {
				ac[t - 1][p - 1] = true;
				last[t - 1][p - 1] = m;
			}
			else pen[t - 1][p - 1] += 20;
		}
		vector<pair<pii,ll>> point(T);
		REP(i, T) {
			int acc = 0, time = 0;
			REP(j, P) {
				if (ac[i][j]) {
					time += last[i][j] + pen[i][j];
					acc--;
				}
			}
			point[i] = { { acc,time },-i };
		}
		sort(ALL(point));
		string ret(2 * T - 1,'0');
		REP(i, T) {
			ret[i * 2] = char((-1)*point[i].second)+'1';
		}
		REP(i, T - 1) {
			if (point[i].first ==point[i + 1].first) {
				ret[i * 2 + 1] = '=';
			}
			else ret[i * 2 + 1] = ',';
		}
		cout << ret << 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 << ',';
		}
	}

C++: #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <functional>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef pair<P,int> PP;
int main(){
	while(true){
		int m,t,p,r;
		scanf("%d%d%d%d",&m,&t,&p,&r);
		if(m==0) break;
		int tim[50][10]={},wa[50][10]={};
		rep(i,50) rep(j,10) tim[i][j]=-1;
		rep(i,r){
			int mm,tt,pp,jj;
			scanf("%d%d%d%d",&mm,&tt,&pp,&jj);
			tt--,pp--;
			if(jj==0) tim[tt][pp]=mm+wa[tt][pp]*20;
			else wa[tt][pp]++;
		}
		int pen[10]={},acp[10]={};
		rep(i,t) rep(j,p){
			if(tim[i][j]==-1) continue;
			acp[i]++;
			pen[i]+=tim[i][j];
		}
		vector<PP> vc;
		rep(i,t) vc.push_back(PP(P(acp[i],-pen[i]),i+1));
		sort(vc.begin(),vc.end(),greater<PP>());
		rep(i,t){
			if(i==0){
				printf("%d",vc[i].second);
				continue;
			}
			if(vc[i].first==vc[i-1].first) printf("=%d",vc[i].second);
			else printf(",%d",vc[i].second);
//			cout << vc[i].second << " acp " << vc[i].first.first << " pen " << vc[i].first.second << endl;
		}
		printf("\n");
	}
	return 0;
}