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++: // 1187.cpp - ICPC Ranking
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct team {
    int id;
    int solved;
    int penalty;
    vector<int> not_accepted;

    team(int id, int n_problems):
        id(id), solved(0), penalty(0), not_accepted(n_problems) {}

    bool operator<(const team& rhs) const {
        if (solved != rhs.solved)
            return solved > rhs.solved;
        if (penalty != rhs.penalty)
            return penalty < rhs.penalty;
        return id > rhs.id;
    }
};

int main()
{
    ios::sync_with_stdio(false);

    int M, T, P, R;
    while (cin >> M >> T >> P >> R, M) {
        vector<team> teams;
        for (int t = 0; t < T; ++t) {
            teams.emplace_back(t + 1, P);
        }

        for (int r = 0; r < R; ++r) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            team& team = teams[t - 1];
            if (j == 0) {
                team.solved += 1;
                team.penalty += m + team.not_accepted[p - 1] * 20;
            } else {
                team.not_accepted[p - 1] += 1;
            }
        }

        sort(teams.begin(), teams.end());

        for (int t = 0; t < T; ++t) {
            if (t > 0) {
                if (teams[t].solved  == teams[t - 1].solved &&
                    teams[t].penalty == teams[t - 1].penalty)
                    cout << "=";
                else
                    cout << ",";
            }
            cout << teams[t].id;
        }
        cout << endl;
    }
}

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

using namespace std;

const int T = 50, P = 10;

struct team{
	int id, time, score;
	int counts[P];
};

team teams[T] = { };

bool comp(const team& a, const team& b){
	if(a.score == b.score){
		if(a.time == b.time){
			return a.id > b.id;
		}
		return a.time < b.time;
	}
	else{
		return a.score > b.score;
	}
}

int main(){
	int m, t, p, r;
	while(cin >> m >> t >> p >> r){
		int a, b, c, d;
		for(int i = 0;i < t;++i){
			teams[i].id = i + 1;
			teams[i].time = teams[i].score = 0;
			fill(teams[i].counts, teams[i].counts + P, 0);
		}
		for(int i = 0;i < r;++i){
			cin >> a >> b >> c >> d;
			--b;
			if(!d){
				teams[b].time += a + teams[b].counts[--c] * 20;
				++teams[b].score;
			}
			else{
				++teams[b].counts[--c];
			}
		}
		sort(teams, teams + t, comp);
		for(int i = 0;i < t;++i){
			if(i > 0){
				if(teams[i - 1].time == teams[i].time && teams[i - 1].score == teams[i].score) cout << "=";
				else cout << ",";
			}
			cout << teams[i].id;
		}
		cout << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<string.h>
#define MAX 50
#define MP 	11
using namespace std;

struct team{
	int id;
	int problems;
	int time;
	int pm[MP];
	int ep[MP];
};

bool mycomp(const team &t1,const team &t2)
{
	if(t1.problems==t2.problems)return t1.time<t2.time;
	return t1.problems>t2.problems;
}

int M,T,P,R;
team teams[MAX];

int solve()
{
	for(int i=0;i<T;i++)
	{
		teams[i].id=i+1;
		for(int j=1;j<=P;j++)
		{
			if(teams[i].ep[j]==0)continue;
			else teams[i].time+=teams[i].ep[j]+teams[i].pm[j];
		}
	}
	sort(teams,teams+P,mycomp);
	cout<<teams[0].id;
	for(int i=1;i<T;i++)
	{
		if(teams[i].problems==teams[i-1].problems&&teams[i].time==teams[i-1].time)
		{
			cout<<"=";
		}else
		{
			cout<<",";
		}
		cout<<teams[i].id;
	}
	cout<<endl;	
}

void input()
{
	int m,t,p,j;
	while(scanf("%d%d%d%d",&M,&T,&P,&R))
	{
		if(M==0&&T==0&&P==0&&R==0)break;
		memset(teams,0,sizeof(teams));
		for(int i=0;i<R;i++)
		{
			scanf("%d%d%d%d",&m,&t,&p,&j);
			if(j==0)
			{
				teams[t-1].problems++;
				teams[t-1].ep[p]=m;
			}
			else
			{
				teams[t-1].pm[p]+=20;
			}
		}
		solve();
	}
}

int main()
{
	input();
	return 0;
}