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

int main(){
    while(true){
        int contestTime, teamCount, probremCount, submitCount;
        cin >> contestTime >> teamCount >> probremCount >> submitCount;
        if(contestTime == 0){
            break;
        }
        int teamPoint[teamCount], teamTime[teamCount], teamPenalty[teamCount][probremCount];
        for(int i = 0; i < teamCount; i++){
            teamPoint[i] = teamTime[i] = 0;
            for(int j = 0; j < probremCount; j++){
                teamPenalty[i][j] = 0;
            }
        }
        for(int i = 0; i < submitCount; i++){
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            t--;
            if(j == 0){
                teamPoint[t]++;
                teamTime[t] += m + teamPenalty[t][p] * 20;
            }else{
                teamPenalty[t][p]++;
            }
        }
        int previousIndex = -1;
        int previousPoint = -1;
        int previousTime = -1;
        for(int i = 0; i < teamCount; i++){
            int maxPoint = 0;
            int topTime = contestTime;
            int topIndex = 0;
            for(int j = 0; j < teamCount; j++){
                if(teamPoint[j] > maxPoint){
                    maxPoint = teamPoint[j];
                    topTime = teamTime[j];
                    topIndex = j;
                }else if(teamPoint[j] == maxPoint){
                    if(topTime >= teamTime[j]){
                        topTime = teamTime[j];
                        topIndex = j;
                    }
                }
            }
            if(i != 0 && maxPoint == previousPoint && topTime == previousTime){
                cout << '=' << topIndex + 1;
            }else if(i != 0){
                cout << ',' << topIndex + 1;
            }else{
                cout << topIndex + 1;
            }
            previousIndex = topIndex;
            previousTime = teamTime[topIndex];
            previousPoint = teamPoint[topIndex];
            teamPoint[topIndex] = -1;
            teamTime[topIndex] = contestTime + 1;
            
        }
            cout << endl;
    }
    return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

struct Team{
	int s_point, s_time, num;
	int w_prob[10];
	
	bool operator<(const Team& another) const{
		if (s_point != another.s_point){
			return (s_point > another.s_point);
		}
		if (s_time != another.s_time){
			return (s_time < another.s_time);
		}
		return(num > another.num);
	}
};

int main(void)
{
	int i, j;
	vector<Team> team(50);

	while(1)
	{
		int m, p ,t, r;
		int m2, p2, t2, r2;

		scanf("%d %d %d %d", &m, &t, &p, &r);
		if (m == 0) break;
		
		for (i = 0; i < t; i++){
			 team[i].num = i+1;
			 team[i].s_point = 0;
			 team[i].s_time = 0;
			 for (j = 0; j < p; j++) team[i].w_prob[j] = 0;
		}

		for (i = 0; i < r; i++){
			scanf("%d %d %d %d", &m2, &t2, &p2, &r2);
			if (r2 == 0){
				team[t2 - 1].s_point++;
				team[t2 - 1].s_time += m2 + 20 * team[t2 - 1].w_prob[p2 - 1];
			}
			else{
				team[t2 - 1].w_prob[p2 - 1]++;
			}
		}

		sort(team.begin(), team.begin() + t );
		for (i = 0; i < t; i++){
			printf("%d", team[i].num);
			if (i != t - 1 && team[i].s_point == team[i + 1].s_point && team[i].s_time == team[i + 1].s_time){
				printf("=");
			}
			else if (i != t - 1){
				printf(",");
			}
		}
		printf("\n");
	}
	
	return(0);
}

C++: 
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1187&lang=jp

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

using namespace std;

struct Team 
{
	int id;
	int AC;
	int time;
	vector<int> WA;
	Team(int ID,int P):id(ID),AC(0),time(0),WA(P+1,0){}

	void accepted(int m, int p){
		AC += 1;
		time += (m + 20*WA[p]);
	}

	void wrongAnswer(int p){
		WA[p] += 1;
	}

	bool operator<( const Team& right ) const 
	{
		if(AC == right.AC)
		{
			if(time == right.time){
				return id > right.id;
			}else{
				return time < right.time;
			}
		}
		else{
			return AC > right.AC;
		}
	}
};


int main()
{
	int M,T,P,R;
	int m,t,p,j;
	while(true)
	{
		cin >> M >> T >> P >> R;
		if( !M && !T && !P && !R ){ break; }
		vector<Team> teams;
		rep(i,T){
			teams.push_back(Team(i+1,P));
		}

		rep(nth,R)
		{
			cin >> m >> t >> p >> j;
			if(j==0){
				teams[--t].accepted(m,p);
			}else{
				teams[--t].wrongAnswer(p);
			}
		}

		sort(ALL(teams));
		
		rep(i,T){
			if(i!=0){
				char sep=',';
				Team prev = teams[i-1];
				if(teams[i].AC==prev.AC && teams[i].time==prev.time){ sep='='; }
				cout << sep;
			}
			cout << teams[i].id;
		}
		cout << endl;
	}
	return 0;
}