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

int main(){
    int m,t,p,r;
    while(cin>>m>>t>>p>>r,m){
        vector<vector<int>> team(t,vector<int>(p,-100));
        for(int i=0;i<r;i++){
            int mm,tt,pp,jj;
            cin>>mm>>tt>>pp>>jj;
            if(!jj)
                team[tt-1][pp-1]=mm+(-(team[tt-1][pp-1]+100))*20;
            else
                team[tt-1][pp-1]--;

        }
        vector<tuple<int,int,int>> rank(t,make_tuple(0,0,0));
        for(int i=0;i<t;i++)
            get<2>(rank[i])=i+1;
        for(int i=0;i<t;i++){
            for(int j=0;j<p;j++)
                if(team[i][j]>=0){
                    get<0>(rank[i])++;
                    get<1>(rank[i])-=team[i][j];
                }


        }
        sort(rank.begin(),rank.end(),greater<tuple<int,int,int>>());
        queue<int> q;
        pair<int,int> pre=make_pair(-1,-1);
        string res="";
        for(int i=0;i<t;i++){
            if(pre==make_pair(get<0>(rank[i]),get<1>(rank[i]))){
                q.push(get<2>(rank[i]));
                continue;
            }
            else{
                if(!res.empty())
                    res+=",";
                int s=q.size();
                for(int j=0;j<s;j++){
                    int a=q.front();
                    if(j!=s-1){
                        res+=to_string(a)+"=";
                        }
                    else
                        res+=to_string(a);

                    q.pop();

                }
                q.push(get<2>(rank[i]));
                pre=make_pair(get<0>(rank[i]),get<1>(rank[i]));
            }

        }
        if(!res.empty() && !q.empty())
            res+=',';
        for(int i=0;!q.empty();i++){
            if(q.size()!=1){
                res+=to_string(q.front())+"=";

            }
            else
                res+=to_string(q.front());
            q.pop();
        }
        cout<<res<<endl;
    }

    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = (1LL << 31) - 1;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
#define MAX_N 100100 * 3

int M, T, PP, R;
bool table[50][10];
int sum[50][10];

bool is(const pair<P, int> p1, const pair<P, int> p2) {
	if (p1.first.first == p2.first.first) {
		if (p1.first.second == p2.first.second) {
			return p1.second > p2.second;
		}
		return p1.first.second < p2.first.second;
	}
	return p1.first.first > p2.first.first;
}

int main() {
	while (cin >> M >> T >> PP >> R&&M + T + PP + R) {
		rep(i, 50)rep(j, 10) {
			table[i][j] = 0;
			sum[i][j] = 0;
		}
		vector<pair<P, int>> vpi;
		rep(i, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--; p--;
			if (j == 0) {
				table[t][p] = 1;
				sum[t][p] += m;
			}
			else sum[t][p] += 20;
		}
		rep(i, T) {
			int a = 0, t = 0;
			rep(j, PP) {
				if (table[i][j]) {
					a++;
					t += sum[i][j];
				}
			}
			vpi.push_back({ {a,t},i + 1 });
		}
		sort(ALL(vpi), is);
		/*rep(i, T) {
			cout << "!!" << vpi[i].first.first << " " << vpi[i].first.second << " " << vpi[i].second << endl;
		}*/
		cout << vpi[0].second;
		rep(i, T - 1) {
			if (vpi[i + 1].first.first == vpi[i].first.first&&
				vpi[i + 1].first.second == vpi[i].first.second) {
				cout << "=" << vpi[i + 1].second;
			}
			else {
				cout << "," << vpi[i + 1].second;
			}
		}
		cout << endl;
	}
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
struct team{
	int num,p,cnt;
	int w[11];
	void init(int n)
	{
		num=n;
		p=0;
		cnt=0;
		for(int i=0;i++<10;)w[i]=0;
	}
	void submit(int m,int i,int j)
	{
		if(j)w[i]++;
		else p+=m+w[i]*20,cnt++;
	}
	bool operator<(team a)
	{
		if(cnt!=a.cnt)return cnt>a.cnt;
		else if(p!=a.p)return p<a.p;
		else return num>a.num;
	}
	bool operator==(team a)
	{
		return cnt==a.cnt&&p==a.p;
	}
};
int M,T,P,R;
main()
{
	while(cin>>M>>T>>P>>R,M)
	{
		team a[55];
		for(int i=0;i++<T;)a[i].init(i);
		for(int i=0;i<R;i++)
		{
			int b,c,d,e;cin>>b>>c>>d>>e;
			a[c].submit(b,d,e);
		}
		sort(a+1,a+T+1);
		for(int i=0;i++<T;)
		{
			if(i==1)cout<<a[i].num;
			else
			{
				cout<<(a[i-1]==a[i]?"=":",")<<a[i].num;
			}
		}
		cout<<endl;
	}
}