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>
#include <cstring>

#define PENALTY_TIME 20

using namespace std;

typedef struct TeamResult {
  int teamNo;
  int solved;
  int totalTime;
  int *incorrect;
} TeamResult;

static void sort(TeamResult *teamResult, int numOfTeam);
static void PrintResult(TeamResult *teamResult, int numOfTeam);

int main(void)
{
  int M, T, P, R;
  while (cin >> M >> T >> P >> R) {
    if (T == 0) break;	// 入力の条件は 1<=T なので0で終了

    TeamResult teamResult[T];
    // TeamResultの初期化
    memset(teamResult, 0, sizeof(teamResult));
    for (int i = 0; i < T; i++) {
      teamResult[i].teamNo = i;
      teamResult[i].incorrect = new int[P];
      for (int j = 0; j < P; j++) {
	teamResult[i].incorrect[j] = 0;
      }
    }
    
    for (int i = 0; i < R; i++) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      if (p == 0) goto FINISH;

      t = t - 1;
      p = p - 1;
      if (j != 0) {
	teamResult[t].incorrect[p]++;
      } else {
	teamResult[t].totalTime += m + teamResult[t].incorrect[p] * PENALTY_TIME;
	teamResult[t].solved++;
      }
    }

    sort(teamResult, T);
    PrintResult(teamResult, T);

    for (int i = 0; i < T; i++) {
      delete [] teamResult[i].incorrect;
    }
  }
FINISH:
  return 0;
}

static void sort(TeamResult *teamResult, int numOfTeam)
{
  TeamResult tmp;

  for (int i = 0; i < numOfTeam; i++) {
    for (int j = i+1; j < numOfTeam; j++) {
      // 正当数で昇順にソート
      if (teamResult[i].solved > teamResult[j].solved) {
	tmp = teamResult[i];
	teamResult[i] = teamResult[j];
	teamResult[j] = tmp;
      } else if (teamResult[i].solved == teamResult[j].solved) {
	// 正当数が同じ場合、総所要時間で昇順にソート
	if (teamResult[i].totalTime < teamResult[j].totalTime) {
	  tmp = teamResult[i];
	  teamResult[i] = teamResult[j];
	  teamResult[j] = tmp;
	} else if (teamResult[i].totalTime == teamResult[j].totalTime) {
	  // 正当数および総所要時間がともに同じ場合、チーム番号で降順にソート
	  if (teamResult[i].teamNo > teamResult[j].teamNo) {
	    tmp = teamResult[i];
	    teamResult[i] = teamResult[j];
	    teamResult[j] = tmp;
	  }
	}
      }
    }
  }
}

static void PrintResult(TeamResult *teamResult, int numOfTeam)
{
  /*
  for (int i = 0; i < numOfTeam; i++) {
    cout << "Team:" << teamResult[i].teamNo + 1
	 << ", Solved:" << teamResult[i].solved
	 << ", Time:" << teamResult[i].totalTime << endl;
  }
  */
  for (int i = numOfTeam; i > 0; i--) {
    cout << teamResult[i - 1].teamNo + 1;
    if (i - 1 > 0 &&
	teamResult[i - 1].solved == teamResult[i - 2].solved &&
	teamResult[i - 1].totalTime == teamResult[i - 2].totalTime) {
      cout << "=";
    } else if (i - 1 > 0) {
      cout << ',';
    } else {
      cout << endl;
    }
  }
}

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

		int CP[50], TT[50], PT[50][10];
		for(int i=0; i<T; i++){
			CP[i] = TT[i] = 0;
			for(int j=0; j<P; j++)
				PT[i][j] = 0;
		}

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

			if(j==0){
				CP[t-1]++;
				TT[t-1] += (m+PT[t-1][p-1]);
			}
			else{
				PT[t-1][p-1] += 20;
			}
		}

		int tnow, tpre = -1;
		bool flg[50];
		for(int i=0; i<T; i++)
			flg[i] = false;

		for(int i=0; i<T; i++){
			tnow = -1;
			for(int j=0; j<T; j++){
				if(flg[j])
					continue;

				if(tnow==-1){
					tnow = j;
				}
				else{
					if(CP[j]>CP[tnow] || (CP[j]==CP[tnow] && TT[j]<=TT[tnow])){
						tnow = j;
					}
				}
			}

			if(tpre!=-1){
				if(CP[tnow]==CP[tpre] && TT[tnow]==TT[tpre])
					cout << '=';
				else
					cout << ',';
			}
			cout << tnow+1;

			flg[tnow] = true;
			tpre = tnow;
		}
		cout << endl;
	}

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

typedef pair<long long, long long> P;
void solve(int m, int t, int p, int r){
	int a[t][p][2];
	for(int i=0; i<t; ++i)
		for(int j=0; j<p; ++j)
			for(int k=0; k<2; ++k)
				a[i][j][k] = 0;
	for(int i=0; i<r; ++i){
		int b[4];
		for(int j=0; j<4; ++j)
			cin >> b[j];
		--b[1];
		--b[2];
		if(b[3] == 0) a[b[1]][b[2]][0] = (b[0] == 0 ? -1 : b[0]);
		else ++a[b[1]][b[2]][1];
	}
	int c[t][2] = {{}};
	for(int i=0; i<t; ++i)
		for(int j=0; j<p; ++j)
			if(a[i][j][0] != 0){
				++c[i][0];
				c[i][1] += (a[i][j][0] == -1 ? 0 : a[i][j][0]) + a[i][j][1] * 20;
			}
	vector<P> v;
	for(int i=0; i<t; ++i)
		v.push_back(P((p-c[i][0])*50000+c[i][1], 2*t-i-1));
	sort(v.begin(), v.end());
	cout << 2*t-v[0].second;
	for(int i=1; i<t; ++i)
		cout << (v[i].first == v[i-1].first ? "=" : ",") << 2*t-v[i].second;
	cout << "\n";
}

int main(){
//	cin.tie(0);
//	ios::sync_with_stdio(false);
	while(1){
		int m, t, p, r;
		cin >> m >> t >> p >> r;
		if(m+t+p+r==0) return 0;
		solve(m, t, p, r);
	}
}