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>
#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;
}

C++: #include <iostream>
#include <queue>
#include <tuple>
#include <map>
#include <set>

using namespace std;

#define rep(i,n) for(int i = 0; i < n; i++)

struct Team {
	int no, time;
	map<int, int> wa;
	set<int> ac;
	Team() : time(0) {}
	bool operator < (const Team &other) {
		if (ac.size() == other.ac.size()) {
			if (time == other.time) {
				return no < other.no;
			}
			return time > other.time;
		}
		return ac.size() < other.ac.size();
	}
	bool operator == (const Team &other) {
		return ac.size() == other.ac.size() && time == other.time;
	}
};

int main() {
	int M, T, P, R;
	while (cin >> M >> T >> P >> R && M) {
		vector<Team> teams(T);
		rep(i, T) {
			teams[i].no = i + 1;
		}
		rep(i, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			if (j == 0) {
				teams[t].time += teams[t].wa[p] * 20 + m;
				teams[t].ac.insert(p);
			}
			else {
				teams[t].wa[p]++;
			}
		}
		sort(teams.begin(), teams.end());
		reverse(teams.begin(), teams.end());
		rep(i, T-1) {
			cout << teams[i].no;
			if (teams[i] == teams[i + 1]) {
				cout << "=";
			}else{
				cout << ",";
			}
		}
		cout << teams.back().no << endl;
	}

	return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
  while(true){
    int M,T,P,R;
    cin>>M>>T>>P>>R;

    if(M==0&&T==0&&P==0&&R==0)
      break;

    int CP[50],TT[50],PT[50][10];
    for (int i = 0; i < T; i++) {
        CP[i] = TT[i] = 0;
        for (int j = 0; j < P; j++)
            PT[i][j] = 0;
    }

    for (int i = 0; i < R; i++) {
        int m, t, p, j;
        cin >> m >> t >> p >> j;

        if (j == 0) {
            CP[t - 1]++;
            TT[t - 1] += (m + PT[t - 1][p - 1]);
        }
        else {
            PT[t - 1][p - 1] += 20;
        }
    }

    int tnow, tpre = -1;
    bool flg[50];
    for (int i = 0; i < T; i++)
        flg[i] = false;

    for (int i = 0; i < T; i++) {
        tnow = -1;
        for (int j = 0; j < T; j++) {
            if (flg[j])
                continue;

            if (tnow == -1) {
                tnow == j;
            }
            else {
                if (CP[j] > CP[tnow] || (CP[j] == CP[tnow] && TT[j]<=TT[tnow])) {
                    tnow = j;
                }
            }
        }

        if (tpre != -1) {
            if (CP[tnow] == CP[tpre] && TT[tnow] == TT[tpre])
                cout << '=';
            else
                cout << ',';
        }
        cout << tnow + 1;

        flg[tnow] = true;
        tpre = tnow;
    }
    cout << endl;
  }
  return 0;
}