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 <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; ++i)

class Team{
public:
    int time;
    int tnum;
    int ans;
    Team(){ time=tnum=ans=0; }
};

bool cmp(const Team &a,const Team &b){
    if(b.ans<a.ans){
        return true;
    } else if(b.ans==a.ans){
        if(b.time>a.time){
            return true;
        } else if(b.time==a.time){
            if(a.tnum>b.tnum){
                return true;
            }
        }
    }
    return false;
}

bool eql(Team &a,Team &b){
    return (b.ans==a.ans && b.time==a.time);
}

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

        rep(i,T){
            rep(j,P){
                miss[i][j]=0;
            }
        }

        rep(k,T){
            ts[k].tnum=k+1;
        }

        rep(i,R){
            int m,t,p,j;
            cin>>m>>t>>p>>j;
            if(j==0){
                ts[t-1].ans++;
                ts[t-1].time+=m+miss[t-1][p-1]*20;
            }
            else
            {
                miss[t-1][p-1]++;
            }
        }

        sort(&ts[0],&ts[T],cmp);
        rep(i,T){
            if(i>=1){
                if(eql(ts[i-1],ts[i])){
                    cout<<"=";
                }
                else{
                    cout<<",";
                }
            }
            cout<<ts[i].tnum;
        }
        cout<<endl;
    }
}

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

using namespace std;

class team
{
public:
	int number;
	int alltime;
	int acnum;
	int wa[11];
	team(){}
	bool operator<(const team &t)const
	{
		return acnum==t.acnum?alltime==t.alltime?number>t.number:alltime<t.alltime:acnum>t.acnum;
	}
	bool operator==(const team &t)const
	{
		return acnum==t.acnum&&alltime==t.alltime;
	}
};

int main()
{
	int m,t,p,r;
	while(1)
	{
		cin>>m>>t>>p>>r;
		if(!(m||t||p||r))break;
		team te[50];
		for(int i=0;i<t;i++)
		{
			te[i]=team();
			te[i].number=i;
		}
		int a,b,c,d;
		for(int i=0;i<r;i++)
		{
			cin>>a>>b>>c>>d;
			if(d)te[--b].wa[c]++;
			else
			{
				b--;
				te[b].acnum++;
				te[b].alltime+=a+20*te[b].wa[c];
			}
		}
		sort(te,te+t);
		for(int i=0;i<t;i++)
		{
			if(i)
			{
				if(te[i-1]==te[i])cout<<"=";
				else cout<<",";
			}
			cout<<te[i].number+1;
		}
		cout<<endl;
	}
	return 0;
}