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 <iomanip>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <memory>
#include <cstring>
#include <cassert>
#include <numeric>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cctype>
#include <unordered_map>
#include <unordered_set>
using namespace std;

#define REP2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define REP(i, n) REP2(i, 0, n)
#define ALL(S) (S).begin(), (S).end()
typedef long long ll;

int main(){
  ios::sync_with_stdio(false);
  int M, T, P, R;
  while (cin >> M >> T >> P >> R && M + T + P + R > 0){
    vector<int> sum(T);
    vector<int> num(T);
    vector<vector<int> > wa(T, vector<int>(P));
    REP(i, R){
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      t--, p--;
      if (j == 0){
        num[t]++;
        sum[t] += wa[t][p] * 20 + m;
      } else {
        wa[t][p]++;
      }
    }
    vector<tuple<int, int, int> > vp;
    REP(i, T){
      vp.push_back(make_tuple(-num[i], sum[i], -i));
    }
    sort(ALL(vp));

    REP(i, T){
      if (i > 0){
        if (get<0>(vp[i]) == get<0>(vp[i - 1]) && get<1>(vp[i]) == get<1>(vp[i - 1])){
          cout << "=";
        } else {
          cout << ",";
        }
      } 
      cout << - get<2>(vp[i]) + 1;
    }
    cout << endl;
  }
  return 0;
}

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

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