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++: //
//  main.cpp
//  AOJ1187
//
//  Created by aki33524 on 2014/07/07.
//  Copyright (c) 2014年 aki33524. All rights reserved.
//

#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

typedef struct {int m, t, p; bool ac;} Submit;

typedef struct _Team{
    int solved, penalty[20], alltime, id;
    
    bool operator<(const _Team& right) const{
        return (solved < right.solved) || (solved == right.solved && alltime > right.alltime) || (solved == right.solved && alltime == right.alltime && id < right.id);
    }
    bool operator==(const _Team& right) const{
        return solved == right.solved && alltime == right.alltime;
    }
    
} Team;

int M, T, P, R;

Submit submits[3000];
Team teams[60];

void solve(){
    memset(teams, 0, sizeof(teams));
    for(int t=0; t<T; t++)
        teams[t].id = t+1;
    
    for(int r=0; r<R; r++){
        Submit &submit = submits[r];
        Team &team = teams[submit.t];
        
        if(submit.ac){
            team.solved++;
            team.alltime += team.penalty[submit.p] + submit.m;
        }else{
            team.penalty[submit.p] += 20;
        }
    }
    
    sort(teams, teams+T);
    
    for(int t=T-1; 0<=t; t--){
        Team &team = teams[t];
        if(0<t){
            cout << team.id;
            cout << (team==teams[t-1] ? "=" : ",");
        }else{
            cout << team.id << endl;
        }
    }
}

int main(int argc, const char * argv[])
{
    while(cin>>M>>T>>P>>R, M|T|P|R){
        for(int r=0; r<R; r++){
            Submit &s = submits[r];
            int m, t, p, j;
            cin>>m>>t>>p>>j;
            s.m = m;
            s.t = t-1;
            s.p = p-1;
            s.ac = j==0;
        }
        solve();
    }
    
    return 0;
}

C++: #include <iostream>
#define N 2001
using namespace std;
struct team{
  int tnum;
  int correct;
  int time;
};
int main(){
  int m,t,p,r,im[N],it[N],ip[N],ij[N],incorrect,i,j;
  struct team data[51];
  while(1){
    cin >> m >> t >> p >> r;
    if(m==0&&t==0&&p==0&&r==0) break;
    for(i=0;i<r;i++) cin >> im[i] >> it[i] >> ip[i] >> ij[i];
    for(i=1;i<=t;i++){
      data[i].tnum=i;
      data[i].correct=0;
      data[i].time=0;
    }
    for(i=0;i<r;i++){
      if(ij[i]==0){
	data[it[i]].correct++;
      	incorrect=0;
	for(j=0;j<i;j++){
	  if(ip[i]==ip[j]) incorrect++;
	}
	data[it[i]].time+=incorrect*20+im[i];
      }
    }
    for(i=1;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].tnum>data[j-1].tnum) swap(data[j],data[j-1]);
      }
    }
    for(i=1;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].time<data[j-1].time) swap(data[j],data[j-1]);
      }
    }
    for(i=1;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].correct>data[j-1].correct) swap(data[j],data[j-1]);
      }
    }
    for(i=1;i<t;i++){
      cout << data[i].tnum;
      if(data[i].correct==data[i+1].correct&&data[i].time==data[i+1].time)
	cout << '=';
      else cout << ',';
      if(i==t-1) cout << data[i+1].tnum;
    }
    cout << endl;
  }
  return 0;
}

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

using namespace std;

#define TMAX 50
#define PMAX 10

struct S{
	int ok,ti,no,wa[PMAX+1],swa;
};

bool operator<(S a,S b){
	return a.ok>b.ok||a.ok==b.ok&&a.ti<b.ti||a.ok==b.ok&&a.ti==b.ti&&a.no>b.no;
}

int main(){
	int M,T,P,R;
	int m,t,p,j;
	vector<S> dia;
	S s;


	while(1){
		cin>>M>>T>>P>>R;
		if(M==0&&T==0&&P==0&&R==0) break;

		for(int i=0;i<=T;i++){
			s.no=i,s.ok=0,s.ti=0,s.swa=0;
			for(int j=1;j<=P;j++) s.wa[j]=0;
			dia.push_back(s);
		}
		dia[0].ok=-1;

		for(int i=0;i<R;i++){
			cin>>m>>t>>p>>j;
			if(j!=0) dia[t].wa[p]++;
			else dia[t].ti+=m,dia[t].swa+=dia[t].wa[p],dia[t].ok++;
		}
		for(int i=1;i<=T;i++){
			dia[i].ti+=dia[i].swa*20;
		}

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

		for(int i=0;i<T-1;i++){
			if(dia[i].ti==dia[i+1].ti&&dia[i].ok==dia[i+1].ok) cout<<dia[i].no<<"=";
			else cout<<dia[i].no<<",";
		}
		cout<<dia[T-1].no<<endl;
		dia.clear();
	}
}