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 INF 5000000
using namespace std;
typedef pair<int, int> P;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
int sum[50][10] = {}, team[50][10] = {};
bool solve[50][10];
int main()
{
    int M, T, P, R;
    while (cin >> M >> T >> P >> R)
    {
        if (M == 0)
            return 0;

        vector<int> m(R), t(R), p(R), j(R);
        for (int i = 0; i < 50; i++)
        {
            for (int k = 0; k < 10; k++)
            {
                sum[i][k] = 0, team[i][k] = 0;
                solve[i][k] = false;
            }
        }
        for (int i = 0; i < R; i++)
        {
            cin >> m[i] >> t[i] >> p[i] >> j[i];
            t[i]--, p[i]--;
        }
        for (int i = 0; i < R; i++)
        {
            if (j[i] == 0)
            {
                team[t[i]][p[i]] = m[i];
                solve[t[i]][p[i]] = true;
            }
            else
            {
                if (!solve[t[i]][p[i]])
                    sum[t[i]][p[i]] += 20;
            }
        }
        vector<int> team_time(T, 0), team_sum(T, 0);
        for (int i = 0; i < T; i++)
        {
            for (int k = 0; k < P; k++)
            {
                if (solve[i][k])
                {
                    team_sum[i]++;
                    team_time[i] += (team[i][k] + sum[i][k]);
                }
            }
        }
        vector<tuple<int, int, int>> v;
        for (int i = 0; i < T; i++)
        {
            v.emplace_back(team_sum[i], -team_time[i], i + 1);
        }
        sort(rbegin(v), rend(v));
        vector<char> st;
        for (int i = 0; i < T - 1; i++)
        {
            if (get<0>(v[i]) == get<0>(v[i + 1]) && get<1>(v[i]) == get<1>(v[i + 1]))
            {
                st.push_back('=');
            }
            else
            {
                st.push_back(',');
            }
        }
        for (int i = 0; i < T; i++)
        {
            if (i < T - 1)
                cout << get<2>(v[i]) << st[i];
            else
                cout << get<2>(v[i]) << endl;
        }
    }
}

C++: #include<iostream>
#include<vector>
#include<map>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#define INF 1e9

typedef long long int ll;
using namespace std;

int wacount[51][11]={};
int timesum[11]={},anssum[11];

bool checkOver(int a,int b){
	if(anssum[a] <  anssum[b])return true;
	if( (anssum[a] == anssum[b]) && (timesum[a]>timesum[b]) )return true;
	return false;
}

void babu_sort(int anssum[11],int timesum[11],int grad[11],int T){
	for(int i=0;i<T;i++){
		for(int j=0;j<T-1-i;j++){
			if( checkOver(grad[j],grad[j+1]) ){
				swap(grad[j],grad[j+1]);
			}
		}
	}
}



void out(int timesum[11],int grad[11],int T){
	vector<char> ans;

	ans.push_back(grad[0] + '0');
	for(int i=1;i<T;i++){
		if(anssum[ grad[i] ]==anssum[ grad[i-1] ]  &&  timesum[ grad[i] ] == timesum[ grad[i-1] ] ){
			ans.push_back('=');

			if(grad[i] <10){
				ans.push_back(grad[i]+'0');
			}
			else{
				ans.push_back(grad[i]/10+'0');
				ans.push_back(grad[i]%10+'0');
			}
		}
		else{
			ans.push_back(',');

			if(grad[i] <10){
				ans.push_back(grad[i]+'0');
			}
			else{
				ans.push_back(grad[i]/10+'0');
				ans.push_back(grad[i]%10+'0');
			}
		}
	}
	for(int i=0;i<ans.size();i++){
		cout<<ans[i];
	}
	cout<<endl;
}

void solve(int anssum[11],int timesum[11],int M,int T,int P,int R){
	int grad[11];
	for(int i=T;i>=1;i--){
		grad[T-i]=i;
	}
	babu_sort(anssum,timesum,grad,T);
	out(timesum,grad,T);
}

/*
int wacount[51][11]={};
int timesum[11]={},anssum[11];

*/

int main(){
	while(1){

		for(int i=0;i<11;i++){
			for(int j=0;j<51;j++){
				wacount[j][i]=0;
			}
			timesum[i]=0;
			anssum[i]=0;
		}

		int M,T,P,R;
		int m,t,p,J;
		cin>>M>>T>>P>>R;
		if(M==0 && T==0 && P==0 && R==0)break;
		for(int i=0;i<R;i++){
			cin>>m>>t>>p>>J;
			if(J!=0){
				wacount[t][p]++;
			}
			else{
				timesum[t]+=m+wacount[t][p]*20;
				anssum[t]++;
			}
		}
	solve(anssum,timesum,M,T,P,R);
	}
	return 0;
}