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

int main(){
    int M, T, P, R;
    while(1){
        cin >> M >> T >> P >> R;
        if(M == 0){
            break;
        }

        int ap[55] = {};
        int at[55] = {};
        int pen[55][11] = {};
        for(int i=0;i<55;i++){
            ap[i] = 0;
            at[i] = 0;
            for(int j=0;j<11;j++){
                pen[i][j] = 0;
            }
        }

        for(int i=0;i<R;i++){
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            if(j==0){
                ap[t]++;
                at[t]+=m+20*pen[t][p];
            }else{
                pen[t][p]++;
            }
        }

        bool c_flag = false;
        for(int i=10;i>=0;i--){
            for(int j=0;j<300*11;j++){
                bool e_flag = false;
                for(int k=T;k>=1;k--){
                    if(ap[k]==i && at[k]==j){
                        if(e_flag){
                            cout << '=';
                        }else if(c_flag){
                            cout << ',';
                        }
                        c_flag = true;
                        e_flag = true;
                        cout << k;
                    }
                }
            }
        }
        cout << endl;
    }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int main(){
	while(1){
		int m,t,p,r;
		cin >> m >> t >> p >> r;
		if(t==0) break;
		int WAnum[51][11];// 1-
		REP(i,51) REP(j,11) WAnum[i][j] = 0;
		pair<int,pair<int,int> > data[51];//p-ac_num penalty
		REP(i,51) {
			data[i].first = p;
			data[i].second.second = t-i;
		}
		REP(i,r){
			int mm,tt,pp,jj;
			cin >> mm >> tt >> pp >> jj;
			if(jj==0){
				//AC
				data[tt-1].first--;
				data[tt-1].second.first += (mm+WAnum[tt-1][pp]*20);
			}else{
				//WA
				WAnum[tt-1][pp]++;
			}
		}
		sort(data,data+t);

		int topac = data[0].first;
		int toppenalty = data[0].second.first;
		cout << t-data[0].second.second+1;
		FOR(i,1,t){
			if(data[i].first==topac&&data[i].second.first==toppenalty){
				cout << "=" << t-data[i].second.second+1;
			}else{
				topac = data[i].first;
				toppenalty = data[i].second.first;
				cout << "," << t-data[i].second.second+1;
			}
		}
		cout << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> v;
vector<vector<int>> miss;
vector<vector<int>> score;
vector<vector<pair<int,int>>> rk;

void solve(int m,int t,int p,int r){
    int in;
    v=vector<vector<int>>(r,vector<int>(4,0));
    miss=vector<vector<int>>(t,vector<int>(p,0));
    score=vector<vector<int>>(t,vector<int>(2,0));
    rk=vector<vector<pair<int,int>>>(p+1,vector<pair<int,int>>(0));
    for(int i=0;i<r;i++){
        for(int j=0;j<4;j++){
            cin>>in;
            v[i][j]=in;
        }
    }
    for(int i=0;i<r;i++){
        if(v[i][3])miss[v[i][1]-1][v[i][2]-1]++;
        else {
            score[v[i][1]-1][0]++;
            score[v[i][1]-1][1]=v[i][0]+miss[v[i][1]-1][v[i][2]-1]*20;
        }
    }
    for(int i=t-1;i>=0;i--){
        rk[score[i][0]].push_back(make_pair(i,score[i][1]));
    }
    for(int i=p;i>=0;i--){
        int maxx=-1;
        for(int j=0;j<rk[i].size();j++){
            maxx=max(maxx,rk[i][j].second);
        }
        bool sw=false;
        for(int j=0;j<=maxx;j++){
            bool swc=false;
            for(int k=0;k<rk[i].size();k++){
                if(rk[i][k].second==j){
                    if(swc)cout<<"="<<rk[i][k].first+1;
                    else {
                        if(sw)cout<<","<<rk[i][k].first+1;
                        else{
                            cout<<rk[i][k].first+1;
                            sw=true;
                        }
                    }
                    swc=true;
                }
            }
        }
        if(i&&sw)cout<<",";
    }
    cout<<endl;
}


int main(void){
    ios::sync_with_stdio(false);
    int a,b,c,d;
    while(cin>>a>>b>>c>>d,a){
        solve(a,b,c,d);
    }
}