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<string>
using namespace std;
bool solved[10000][100];
long long time[10000][100];
long long anstime[10000];
int main(){
	int m,t,p,r;
	while(true){
		cin>>m>>t>>p>>r;
		if(m==0&&t==0&&p==0&&r==0)
			break;
		for(int i=0;i<t;i++){
			anstime[i]=0;
			for(int j=0;j<p;j++){
				solved[i][j]=false;
				time[i][j]=0;
			}
		}
		for(int i=0;i<r;i++){
			int a[4];
			for(int j=0;j<4;j++)
				cin>>a[j];
			if(a[3]==0){
				solved[a[1]-1][a[2]-1]=true;
				anstime[a[1]-1]+=time[a[1]-1][a[2]-1]+a[0];
			}
			else
				time[a[1]-1][a[2]-1]+=20;
		}
		int b[100];
		for(int i=0;i<t;i++){
			int count=0;
			for(int j=0;j<p;j++)
				count+=solved[i][j];
			anstime[i]=count*1000-anstime[i];
			b[i]=i+1;
		}
		for(int i=0;i<t-1;i++){
			for(int j=t-1;j>i;j--){
				if(anstime[j]>anstime[j-1]||(anstime[j]==anstime[j-1]&&b[j]>b[j-1])){
					int tmp=anstime[j];
					anstime[j]=anstime[j-1];
					anstime[j-1]=tmp;
					tmp=b[j];
					b[j]=b[j-1];
					b[j-1]=tmp;
				}
			}
		}
		cout<<b[0];
		for(int i=1;i<t;i++){
			if(anstime[i]==anstime[i-1])
				cout<<'=';
			else
				cout<<',';
			cout<<b[i];
		}
		cout<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> Pii;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;

bool eqPii(const Pii& p, const Pii& q) {
    return p.first == q.first && p.second == q.second;
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int M, T, P, R;
    while (cin >> M >> T >> P >> R, M) {
        VV score(T, V(P, 0));
        VV done(T, V(P, 0));
        rep(i, R) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            t--; p--;
            score[t][p] += (j == 0 ? m : 20);
            if (j == 0) done[t][p] = 1;
        }

        V ac(T);
        rep(t, T) {
            ac[t] = accumulate(all(done[t]), 0);
        }

        V pena(T, 0);
        rep(t, T) {
            rep(p, P) {
                if (done[t][p]) pena[t] += score[t][p];
            }
        }

        vector<pair<Pii, int>> v;
        rep(t, T) {
            v.emplace_back(make_pair(Pii(-ac[t], pena[t]), -(t + 1)));
        }
        sort(all(v));

        rep(i, T) {
            cout << -v[i].second;
            if (i + 1 == T) continue;
            if (i + 1 < T && eqPii(v[i].first, v[i + 1].first)) {
                cout << "=";
            } else {
                cout << ",";
            }
        }
        cout << endl;
    }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Question{
public:
    bool isAC;
    int p;
};
class Team{
public:
    int ID;
    int AC;
    int ptime;
    vector<Question> q;

    Team() : ID(-1){}
    Team(int id,int qn)
        : ID(id), q(qn+1)
    {
    }

    void submit(int m,int p,int j){
        if(j == 0){
            q[p].p += m;
            q[p].isAC = true;
            AC++;
            ptime += q[p].p;
        }else{
            q[p].p += 20;
        }
    }
};

bool operator==(const Team& a,const Team& b){
    return a.AC == b.AC && a.ptime == b.ptime;
}
bool operator!=(const Team& a,const Team& b){
    return !(a == b);
}

//M:テァツオツづ、ツコツ?ヲツ卍づゥツ鳴?
//T:テ」ツδ?」ツδシテ」ツδ?ヲツ閉ー
//P:テ・ツ閉湘ゥツ。ツ古ヲツ閉ー
//R:テヲツ渉静・ツ?コテヲツ閉ー
void solve(int M,int T,int P,int R){
    vector<Team> team;
    for(int i=1;i<=T;i++){
        team.push_back(Team(i,P));
    }
    for(int i=0;i<R;i++){
        int m,t,p,j;
        cin >> m >> t >> p >> j;
        team[t-1].submit(m,p,j);
    }
    std::sort(team.begin(),team.end(),
            [](const Team& a,const Team& b)->bool{
                if(a.AC < b.AC)
                    return true;
                if(a.AC > b.AC)
                    return false;
                if(a.ptime > b.ptime)
                    return false;
                return a.ID < b.ID;
            }
            );
    std::reverse(team.begin(),team.end());
    bool f = false;
    cout << team[0].ID;
    for(int i=1;i<T;i++){
        if(team[i-1] == team[i]){
            cout << "=" << team[i].ID;
        }else{
            cout << "," << team[i].ID;
        }
    }
    //for(auto t : team)
    //{
    //    //cout << t.ID << " :" << t.AC << " ," << t.ptime << endl;
    //}
    cout << endl;
}

int main(){
    while(true){
        int M,T,P,R;
        cin >> M >> T >> P >> R;
        if(!M&&!T&&!P&&!R)
            return 0;
        solve(M,T,P,R);
    }
}