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 <stdio.h>

typedef struct{
  int team;
  int ans[10];
  int time[10];
  int anum;
  int tnum;
}data_t;

void InsSort(data_t data[], int n){
  data_t temp;
  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j-1].team<temp.team ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j] = temp;
    }
  }

  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j-1].tnum>temp.tnum ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j] = temp;
    }
  }
  
  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j-1].anum<temp.anum ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j] = temp;
    }
  }
}

int main(void){
  int M, T, P, R;
  int m, t, p, j;
  data_t data[50];
  while(1){
    scanf("%d%d%d%d", &M, &T, &P, &R);
    if(M==0 && T==0 && P==0 && R==0){
      break;
    }

    for(int i=0; i<T; i++){
      data[i].team = i+1;
      data[i].anum = 0;
      data[i].tnum = 0;
      for(int j=0; j<10; j++){
	data[i].ans[j] = 1;
	data[i].time[j] = 0;
      }
    }

    for(int i=0; i<R; i++){
      scanf("%d%d%d%d", &m, &t, &p, &j);
      if(j == 0){
	data[t-1].ans[p-1] = 0;
	data[t-1].time[p-1] += m;
      }else if(j == 1){
	data[t-1].time[p-1] += 20;
      }
    }
    for(int i=0; i<T; i++){
      for(int j=0; j<P; j++){
	if(data[i].ans[j] == 0){
	  data[i].anum++;
	  data[i].tnum += data[i].time[j];
	}
      }
    }
    InsSort(data, T);

    printf("%d", data[0].team);
    for(int i=1; i<T; i++){
      if(data[i].anum==data[i-1].anum && data[i].tnum==data[i].tnum){
	printf("=");
      }else{
	printf(",");
      }
      printf("%d", data[i].team);
    }
    printf("\n");
  }
  return 0;
}

C++: \
#include <bits/stdc++.h>

#define rep(i, from, to) for (int i = from; i < to; ++i)
#define REP(i, from, to) for (int i = from; i <= to; ++i)
#define dbp(x) cout<<#x<<": "<<x<<endl;
#define dbp2(x,y) cout<<#x<<","<<#y<<": "<<x<<","<<y<<endl;
#define dbp3(x,y,z) cout<<#x<<","<<#y<<","<<#z<<": "<<x<<","<<y<<","<<z<<endl;
#define dbp4(w,x,y,z) cout<<#w<<","<<#x<<","<<#y<<","<<#z<<": "<<w<<","<<x<<","<<y<<","<<z<<endl;

using namespace std;
struct team {
	int total, p, id;
	int miss[11], isOk[11], time[11];
	team() {
		fill(miss, miss + 11, 0);
		fill(isOk, isOk + 11, 0);
		fill(time, time + 11, 0);
		total = 0;
		p = 0;
		id = 0;
	}
};

bool cmp(const team &t1, const team &t2) {
	if (t1.p > t2.p)
		return true;
	if (t1.p < t2.p)
		return false;
	if (t1.total > t2.total)
		return true;
	if (t1.total < t2.total)
		return false;
	if (t1.id > t2.id)
		return true;
	return false;
}

bool cmp2(const team &t1, const team &t2) {
	if (t1.p == t2.p) {
		if (t1.total == t2.total) {
			return t1.id < t2.id;
		} else {
			return t1.total > t2.total;
		}
	} else {
		return t1.p < t2.p;
	}
}

bool eq(team t1, team t2) {
	return t1.p == t2.p && t1.total == t2.total;
}
team data[51];

void solve() {
	int M, T, P, R, m, t, p, j;

	while (cin >> M >> T >> P >> R, M || T || P || R) {
		fill(data, data + 51, team());
		rep(i, 0, R)
		{
			cin >> m >> t >> p >> j;
			if (j == 0) {
				data[t].isOk[p] = 1;
				data[t].time[p] = m;
				data[t].p++;
			} else {
				data[t].miss[p]++;
			}
		}

		REP(i, 1, T)
		{
			data[i].id = i;
			REP(j, 1, P)
			{
				data[i].total += data[i].isOk[j] * data[i].time[j]
						+ data[i].isOk[j] * data[i].miss[j] * 20;

			}
			team di = data[i];
//			dbp3(di.id, di.p, di.total);
		}
		sort(data + 1, data + T + 1, cmp2);
		reverse(data + 1, data + T + 1);
		team before = data[1];
		cout << data[1].id;
		REP(i, 2, T)
		{
			team now = data[i];
			if (eq(before, now))
				cout << "=" << now.id;
			else
				cout << "," << now.id;
			before = now;
		}
		cout << endl;
	}
}

int main() {
	solve();
	return 0;
}

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

// 構造体
struct team{
	int t, c, m;	// チームNo., 正解数, 所要時間合計
	int p[10];		// ペナルティー
};

// オーバーロード
bool operator<(const team team1, const team team2){
	bool rep;
	if(team1.c == team2.c){
		rep = (team1.m == team2.m) ? team1.t > team2.t : team1.m < team2.m;
	}else{
		rep = (team1.c > team2.c);
	}
	return rep;
}

int main(){
	int M, T, P, R;
	while( cin >> M >> T >> P >> R, M || T || P || R ){
		vector<team> teams(T);
		for(int i = 0; i < T; i++){
			teams[i].t = i+1;
//			teams[i].c = 0;
//			teams[i].m = 0;
		}
		for(int i = 0; i < R; i++){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if( j == 0 ){
				teams[t-1].c++;
				teams[t-1].m += (m + 20 * teams[t-1].p[p-1]);
			}else{
				teams[t-1].p[p-1]++;
			}
		}
		sort(teams.begin(), teams.end());
		// 出力
		cout << teams[0].t;
		for(int i = 1; i < T; i++){
			if( teams[i].c == teams[i-1].c && teams[i].m == teams[i-1].m ) cout << "=";
			else cout << ",";
			cout << teams[i].t;
		}
		cout << endl;
	}
}