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>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)n;++i)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(x) x.begin(),x.end()

struct team {
    int id, pro, tm;
    team(int id, int pro, int tm) : id(id), pro(pro), tm(tm) {}
    bool operator < (const team& a) const {
	if (pro != a.pro) { return pro < a.pro; }
	if (tm != a.tm) { return tm > a.tm; }
	if (id != a.id) { return id < a.id; }
    }
};

vector<team> vec;

int M, T, P, R;
int pn[50][10];
int ac[50][10];

int main() {
    while (scanf("%d %d %d %d", &M, &T, &P, &R), M) {
	vec.clear();
	memset(pn, 0, sizeof(pn));
	memset(ac, 0, sizeof(ac));

	rep(i, R) {
	    int m, t, p, j;
	    scanf("%d %d %d %d", &m, &t, &p, &j);
	    --t; --p;
	    if (j) ++pn[t][p];
	    else ac[t][p] = m;
	}

	rep(i, T) {
	    int sol = 0, tm = 0;
	    rep(j, P) {
		if (!ac[i][j]) continue;
		++sol;
		tm += ac[i][j] + pn[i][j] * 20;
	    }
	    vec.push_back(team(i + 1, sol, tm));

	    cout << i + 1 << " " << sol << " " << tm << endl;
	}

	sort(ALL(vec));
	reverse(ALL(vec));

	int i;
	for (i = 0; i < T; ++i) {
	    if (i) printf(",");
	    team &tt = vec[i];
	    int j = i;

	    while (j + 1 < T && vec[j + 1].pro == vec[i].pro && vec[j + 1].tm == vec[i].tm) ++j;

	    for (int k = i; k <= j; ++k) {
		if (k != i) printf("=");
		printf("%d", vec[k].id);
	    }
	    i = j;
	}
	puts("");
    }
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
#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];

void 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 <vector>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functional>

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

		vector<vector<int> > time_(T, vector<int>(P, 0));
		vector<vector<bool> > cor(T, vector<bool>(P, false));

		vector<int> score(T, 0);
		vector<int> rank(T, 0);

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

			cin >> m >> t >> p >> j;

			if (j == 0)
			{
				time_[t - 1][p - 1] += m;

				cor[t - 1][p - 1] = true;
			}
			else
			{
				time_[t - 1][p - 1] += 20;
			}
		}

		for (int i = 0; i < T; i++)
		{
			for (int j = 0; j < P; j++)
			{
				if (cor[i][j] == true)
				{ 
					score[i] += 100000; 

					score[i] -= time_[i][j];
				}
			}
		}

		for (int i = 0; i < T; i++) { rank[i] = i + 1; }

		for (int i = 0; i < T; i++)
		{
			for (int j = i + 1; j < T; j++)
			{
				if (score[i] < score[j])
				{
					swap(score[i], score[j]);

					swap(rank[i], rank[j]);
				}
				else if (score[i] == score[j] && rank[i] < rank[j])
				{
					swap(rank[i], rank[j]);
				}
			}
		}

		for (int i = 0; i < T; i++)
		{
			if (i + 1 == T)
			{
				cout << rank[i] << endl;

				break;
			}
			else if (score[i] == score[i + 1])
			{
				cout << rank[i] << '=';
			}
			else
			{
				cout << rank[i] << ',';
			}
		}
	}

	return 0;
}