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);
    }
    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>
#include<cstdio>
#include<iostream>
using namespace std;

int m,t,p,r;
int zi,na,mo,ans;
int noa[52][12];
int acs[52];
int minu[52];
int check[52];
int o;
int num;

main(){
  while(cin >> m >> t >> p >> r, m||t||p||r){
    for(int i=1;i<=t;i++){
      for(int j=1;j<=p;j++){
        noa[i][j]=0;
      }
      acs[i]=0;
      minu[i]=0;
      check[i]=0;
    }

    for(int i=0;i<r;i++){
      cin >> zi >> na >> mo >> ans;
      if(ans==0){
        acs[na]++;
        minu[na]+=zi+noa[na][mo]*20;
      }else{
        noa[na][mo]++;
      }
    }

    for(int i=0;i<t;i++){
      num=-1;
      for(int j=t;j>0;j--){
        if(check[j]==0){
          if(num==-1){
            num=j;
          }
          else if(acs[num]<acs[j]){
            num=j;
          }
        }
      }
      if(i!=0){
        if(minu[num]==minu[o] && acs[num]==acs[o]){
          cout << "=";
        }
        else{
          cout << ",";
        }
      }
      cout << num;
      check[num]=1;
      o=num;
    }
    cout << endl;
  }
}

C++: #include <iostream>
#include <map>
#include <set>
#include <vector>
#include <algorithm>

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