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 <bits/stdc++.h>
#include <stdint.h>

typedef uint32_t u32;
typedef uint64_t u64;

class Team {
public:
  int id;
  int ac_num;
  int pena;
  int miss[16];
  Team() {
    ac_num = pena = 0;
    for(int& I : miss) I = 0;
  }    
private:
};

bool operator < (const Team& left, const Team& right) {
  if( left.ac_num != right.ac_num ) return -left.ac_num < -right.ac_num;
  if( left.pena != right.pena ) return left.pena < right.pena;
  return left.id > right.id;
}

bool operator == (const Team& left, const Team& right) {
  if( left.ac_num != right.ac_num ) return false;
  if( left.pena != right.pena ) return false;
  return true;
}

int main() {
  
  int M, T, P, R;
  int m, t, p, j;
  for(;;) {
    Team team[128];
    for(int i = 0; i < 128; ++i) team[i].id = i;
    std::cin >> M >> T >> P >> R;
    if( M == 0 and T == 0 and P == 0 and R == 0 ) break;
    for(int i = 0; i < R; ++i) {
      std::cin >> m >> t >> p >> j;
      if( j == 0 ) {
        team[t].pena += team[t].miss[p] * 20 + m;
        team[t].ac_num += 1;
      }
      else {
        team[t].miss[p] += 1;
      }
    }
    std::sort(team + 1, team + T + 1);
    std::cout << team[1].id;
    for(int i = 2; i <= T; ++i) {
      std::cout << (team[i-1] == team[i] ? '=' : ',') << team[i].id;
    }
    std::cout << std::endl;
  }

  
  return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<queue>
#include<stack>
#include<cstdlib>
#include<algorithm>
#include<cmath>

#define rep(n,cnt) for(int cnt=0;cnt<n;++cnt)

using namespace std;

template <typename TYPE>
void printArray(TYPE* array, int size){
  rep(size,i) cout << array[i] << "\t" << flush;
  cout << endl;
}

int StringToInt(string str){
  return atoi(str.c_str());
}

double factorial(double n){
  double sum=1;
  for(int i=n;i>=1;i--){
    sum = i*sum;
  }
  return sum;
}

double combination(double n, double k){
  double denominator = 1;
  for(int i=n,j=0;j<k;j++,i--) denominator*=i;
  return denominator/factorial(k);
}

#define MAX_M 300
#define MAX_T 50
#define MAX_P 10
#define MAX_R 2000

class Team{
public:
    int num;
    int collect;
    int time;
};

int M,T,P,R;
int m[MAX_R],t[MAX_R],p[MAX_R],j[MAX_R];
Team team[MAX_T];

int main(){
    while(1){
	cin >> M;
	cin >> T;
	cin >> P;
	cin >> R;
	if(M == 0 && T == 0 && P == 0 && R == 0) return 0;	
        
	rep(T,i){
	    team[i].num = i+1;
	    team[i].collect = 0;
            team[i].time = 0;
	}

	rep(R,i){
            cin >> m[i];
	    cin >> t[i];
	    cin >> p[i];
	    cin >> j[i];
	}	
        
	rep(R,i){
            if(j[i] == 0){
		team[t[i]-1].collect++;
		team[t[i]-1].time += m[i];                
	    }
	    else{
		team[t[i]-1].time += 20;
	    }
	}

 	for(int i=0;i<T;i++){
	    for(int j=T-1;j>=i;j--){
		if(team[i].collect < team[j].collect){
		    Team buf = team[i];
                    team[i] = team[j];
		    team[j] = buf;
		}
	    }
	}

        for(int i=0;i<T;i++){
	    for(int j=T-1;j>=i;j--){
		if(team[i].collect < team[j].collect && team[i].time < team[j].time){
		    Team buf = team[i];
                    team[i] = team[j];
		    team[j] = buf;
		}
	    }
	}

        
       
        for(int i=0;i<T;i++){
	    for(int j=T-1;j>=i;j--){
		if(team[i].collect == team[j].collect && team[i].time == team[j].time && team[i].num < team[j].num){
		    Team buf = team[i];
                    team[i] = team[j];
		    team[j] = buf;
		}
	    }
	}

	cout << team[0].num;
	for(int i=1;i<T;i++){
            if(team[i].collect == team[i-1].collect && team[i].time == team[i-1].time){
		cout << "=" << team[i].num;
	    }
	    else{
                cout << "," << team[i].num;
	    }
	}
	cout << endl;

	rep(T,i){
	    cout << team[i].num << " " << team[i].collect << " " << team[i].time << endl;;
	}
    }
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<map>
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,int> tri;

int main(){
  int M,T,P,R;
  int m,t,p,x;
  int wa[55][55], ac[55];
  int sum[55];

  while(cin >> M >> T >> P >> R, M){
    memset(wa,0,sizeof(wa));
    memset(ac,0,sizeof(ac));
    memset(sum,0,sizeof(sum));

    for(int i=0;i<R;i++){
      cin >> m >> t >> p >> x;
      if(x==0)sum[t] += m + wa[t][p]*20, ac[t]++;
      else wa[t][p]++;
    }

    vector<tri> rank;
    for(int i=1;i<=T;i++){
      rank.push_back(tri(pii(-ac[i],sum[i]),-i));
    }

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

    for(int i=0;i<T;i++){
      cout << -rank[i].second;
      if(i+1==T)cout << endl;
      else if(rank[i].first == rank[i+1].first)cout << "=";
      else cout << ",";
    }
  }
}