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<cstdio>
#include<vector> 
#include<algorithm>
using namespace std;

class Present{
public:
  int m;
  int t;
  int p;
  int j;
  Present():m(0),t(0),p(0),j(0){}
};
class Team{
public:
  int num;
  int solve;
  int time;
  Team():num(0),solve(0),time(0){}
};

bool compare_solve(const Team& left, const Team& right){
  return left.solve > right.solve;
}
bool compare_time(const Team& left, const Team& right){
  return left.time <= right.time;
}

int main(){
  int H, T, P, R;
  for(;;){
    scanf("%d %d %d %d", &H, &T, &P, &R);
    if( H == 0 && T == 0 && P == 0 && R == 0)
      return 0;
    vector<Present> pr(R);
    for(int i = 0; i < R; i++){
      scanf("%d %d %d %d", &pr[i].m, &pr[i].t, &pr[i].p, &pr[i].j);
    }
    vector<Team> team(T);
    for(int i = 0; i < T; i++){  
      team[i].num = i + 1;
      for(int j = 0; j < R; j++){
	if(pr[j].t == team[i].num){
	  if(pr[j].j == 0){
	    team[i].solve += 1; 
	    team[i].time += pr[j].m;
	    for(int k = 0; k < R; k++){
	      if(pr[k].t == team[i].num && pr[k].p == pr[j].p && pr[k].j != 0 )
		team[i].time += 20;
	    }
	  }
	}
      }
    }
    sort(team.begin(),team.end(),compare_time);
    stable_sort(team.begin(),team.end(),compare_solve);
    
    cout << team[0].num;
    for(int i = 1; i < T; i++){
      if(team[i-1].solve == team[i].solve && team[i-1].time == team[i].time)
	cout << "=";
      else
	cout << ",";
      cout << team[i].num;
    }
    cout << endl;
  }
}

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

using namespace std;

int main()
{
    int M, T, P, R;
    
    while (scanf("%d %d %d %d", &M, &T, &P, &R) && M){
        vector<pair<pair<int, int>, int> > record(T);
        int wa[16][64] = {0};
        
        for (int i = 0; i < T; i++) record[i].second = -(i + 1);
        
        for (int i = 0; i < R; i++){
            int m, t, p, j;
            scanf("%d %d %d %d", &m, &t, &p, &j);
            if (j) wa[t - 1][p] += 20;
            else {
                record[t - 1].first.first--;
                record[t - 1].first.second += m + wa[t - 1][p];
            }
        }
        
        sort(record.begin(), record.end());
        
        for (int i = 0; i < T; i++){
            printf("%d", -record[i].second);
            if (i + 1 < T && record[i].first == record[i + 1].first) printf("=");
            else if (i + 1 < T) printf(",");
            else printf("\n");
        }
    }
    
    return (0);
}

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

int main() {

  long long int m, t, p, r, in_m, in_t, in_p, in_j;

  while( true ) {

    cin >> m >> t >> p >> r;
    if ( m == 0 ) break;

    vector< pair< long long int, pair< long long int, long long int > > > list;
    for ( long long int i = 0; i < t; i++ ) {
      list.push_back( make_pair( 0, make_pair( 0, -(i+1) ) ) );
    }

    long long int pena[51][11] = {0};

    for ( long long int i = 0; i < r; i++ ) {
      cin >> in_m >> in_t >> in_p >> in_j;
      in_t--;
      in_p--;
      if ( in_j == 0 ) {
	list[in_t].first--;
	list[in_t].second.first += in_m + pena[in_t][in_p] * 20;
      }else {
	pena[in_t][in_p]++;
      }
    }

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

    for ( long long int i = 0; i < t; i++ ) {
      if ( i > 0 ) {
	if ( list[i].first == list[i-1].first && list[i].second.first == list[i-1].second.first ) {
	  cout << "=";
	}else {
	  cout << ",";
	}
      }
      cout << -list[i].second.second;
    }
    cout << endl;

  }

  return 0;

}

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

typedef pair<int, int> Data;
typedef pair<Data, Data> Pair;

int M;
int T;
int P;
int R;
int teams[114514];
int penalty[114514];
int correct[114514];
int wrong[1145][1419];
Pair ps[114514];

bool CompareScore(int a, int b) {
  if (correct[a] != correct[b]) return correct[a] > correct[b];
  if (penalty[a] != penalty[b]) return penalty[a] < penalty[b];
  return false;
}

bool Compare(int a, int b) {
  if (correct[a] != correct[b]) return correct[a] > correct[b];
  if (penalty[a] != penalty[b]) return penalty[a] < penalty[b];
  return a > b;
}

int main() {
  while (1) {
    scanf("%d%d%d%d", &M, &T, &P, &R);
    if ((M|T|P|R) == 0) return 0;

    for (int i=0; i<T; i++) teams[i] = i+1;
    fill(wrong[0], wrong[114], 0);
    fill(penalty, penalty+114, 0);
    fill(correct, correct+114, 0);

    for (int i=0; i<R; i++) {
      int m, t, p, ji;
      scanf("%d%d%d%d", &m, &t, &p, &ji);
      ps[i] = Pair(Data(m, -ji), Data(t, p));
    }
    sort(ps, ps+R);
  
    for (int i=0; i<R; i++) {
      Pair pa = ps[i];
      Data d1 = pa.first;
      Data d2 = pa.second;
      int m = d1.first;
      int ji = -d1.second;
      int t = d2.first;
      int p = d2.second;
  
      if (ji != 0) {
        wrong[t][p]++;
      } else {
        correct[t]++;
        penalty[t] += m + 20*wrong[t][p];
      }
    }
  
    sort(teams, teams+T, Compare);
    printf("%d", teams[0]);
    for (int i=1; i<T; i++) {
      if (!CompareScore(teams[i-1], teams[i])) printf("=");
      else printf(",");
      printf("%d", teams[i]);
    }
    puts("");
  }
}