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>
using namespace std;

bool comp(pair<pair<int,int>,int> p1, pair<pair<int,int>,int> p2){

    if(p1.first.first == p2.first.first){
        if(p1.first.second == p2.first.second){
            return p1.second < p2.second;
        }
        return p1.first.second > p2.first.second;
    }
    return p1.first.first < p2.first.first;

}

int main() {

    while(1) {

        int M,T,P,R;

        cin >> M >> T >> P >> R;

        if(M == 0 && T == 0 && P == 0 && R == 0) break;

        pair<int,int> team[T+1]; //solve_num, time
        pair<bool,int> try_progrums[T+1][P]; //is_tried, tried_count

        team[0] = make_pair(-1,-1);

        for(int i=1; i<T+1; i++){
            team[i] = make_pair(0,0);
            for(int j=0; j<P; j++) {
                try_progrums[i][j] = make_pair(false, 0);
            }
        }

        for(int i=0; i<R; i++){

            int m, t, p, j;

            cin >> m >> t >> p >>j;

            if(j == 0){
                team[t].first++;
                team[t].second += m + try_progrums[t][p].second * 20;
            }
            else{
                try_progrums[t][p].first = true;
                try_progrums[t][p].second++;

            }
        }

        pair<pair<int,int>,int> team_result[T+1];

        for(int i=0; i<T+1; i++){
            team_result[i] = make_pair(make_pair(team[i].first,team[i].second),i);

    //        cout << team[i].first << " ";
        }

  /*      cout << endl;

        for(int i=0; i<T+1; i++){
            cout << team[i].second << " ";
        }

        cout << endl;
*/
        sort(team_result,team_result+T+1,comp);

        cout << team_result[T].second;

        for(int i=T; i>1; i--){
            if(team_result[i].first.first == team_result[i-1].first.first && team_result[i].first.second == team_result[i-1].first.second){
                cout << '=' << team_result[i-1].second;
            }
            else{
                cout << ',' << team_result[i-1].second;
            }
        }

        cout << endl;




    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct S{
  int number;
  int AC[10]={},WA[10]={},time=0;
  int sumAC=0;
};
bool cmp(S a,S b){
  if(a.sumAC==b.sumAC){
      if(a.time==b.time)return a.number>b.number;
      return a.time<b.time;
  }
  return a.sumAC>b.sumAC;
 
}
signed main (){
  int M,T,P,R;
  while(cin>>M>>T>>P>>R&&M){
    vector<S> v(T);
    for(int i=0;i<T;i++)v[i].number=i+1; //まずは番号を入れる
    for(int i=0;i<R;i++){
      int m,t,p,j;
      cin>>m>>t>>p>>j;
      t--;p--; //0-indexに
      if(j==0){ //正解なら
          v[t].AC[p]++;
          v[t].time+=v[t].WA[p]*20;
          v[t].time+=m;
      }
      else v[t].WA[p]++; //誤答なら
    }
    for(int i=0;i<T;i++){
      for(int j=0;j<P;j++){
        v[i].sumAC+=v[i].AC[j]; //各チームの正解数を求める
      }
    }
    sort(v.begin(),v.end(),cmp); //上で書いた比較関数cmpを使ってソート。配列の中身が強い順になる
 
    for(int i=0;i<T;i++){
      cout<<v[i].number;
      while(i+1<T&&v[i].sumAC==v[i+1].sumAC&&v[i].time==v[i+1].time){ //順位が同じ時の処理
          i++;
          cout<<'='<<v[i].number;
      }
      if(i!=T-1)cout<<','; //最後はカンマ打ちません
    }
    cout<<endl;
  }
}