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>
#define N 2001
using namespace std;
struct team{
  int tnum;
  int correct;
  int time;
};
int main(){
  int m,t,p,r,im[N],it[N],ip[N],ij[N],incorrect,i,j;
  struct team data[51];
  while(1){
    cin >> m >> t >> p >> r;
    if(m==0&&t==0&&p==0&&r==0) break;
    for(i=0;i<r;i++) cin >> im[i] >> it[i] >> ip[i] >> ij[i];
    for(i=1;i<=t;i++){
      data[i].tnum=i;
      data[i].correct=0;
      data[i].time=0;
    }
    for(i=0;i<r;i++){
      if(ij[i]==0){
	data[it[i]].correct++;
      	incorrect=0;
	for(j=0;j<i;j++){
	  if(it[i]==it[j]&&ip[i]==ip[j]) incorrect++;
	}
	data[it[i]].time=data[it[i]].time+incorrect*20+im[i];
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].tnum>data[j-1].tnum) swap(data[j],data[j-1]);
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].time<data[j-1].time) swap(data[j],data[j-1]);
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].correct>data[j-1].correct) swap(data[j],data[j-1]);
      }
    }
    for(i=1;i<t;i++){
      cout << data[i].tnum;
      if(data[i].correct==data[i+1].correct&&data[i].time==data[i+1].time)
	cout << '=';
      else cout << ',';
      if(i==t-1) cout << data[i+1].tnum;
    }
    cout << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
struct team{
    int tID;
    int pID;        //問題ID
    vector<int> p;  //誤答数
    int ansnum;     //正答数
    int time;       //時間
	int place;
 
    bool operator<( const team& right ) const {
        return ( ansnum == right.ansnum ? 
            time > right.time : ansnum < right.ansnum );
    }
	bool operator==( const team& right ) const {
        return ( ansnum == right.ansnum ? 
            time == right.time : false );
    }
};
 
int main(void){
   // FILE* fp_in = freopen("data.txt", "r", stdin);
 
    while(1) {
        int M, T, P, R;
        cin >> M >> T >> P >> R;
        if( M == 0 && T == 0 && P == 0 && R == 0 ) break; 
 
        //■■■■チームテーブル作成■■■■
        vector<team> teams;
        team newteam;
        for(int i = 0; i <= P; i++)
            newteam.p.push_back(0);
 
        for(int i = 0; i < T; i++) {
            newteam.tID = i + 1;
            newteam.ansnum = 0;
			newteam.time = 0;
            teams.push_back( newteam );
        }
 
        //■■■■レコード取得■■■■
        for(int i = 0; i < R; i++) {
            int tID, pID, time_i, j;
            cin >> time_i >> tID >> pID >> j;
           
			if( j == 0 ) {
				teams.at(tID - 1).ansnum ++;
				teams.at(tID - 1).time += time_i + 20 * teams.at(tID - 1).p.at(pID);
			} else {
				teams.at( tID - 1 ).p.at( pID ) ++;
			}

        }
 
        sort( teams.begin(), teams.end() );
		
		cout << teams.at(teams.size() - 1).tID;
		for(int i = teams.size() - 2; i >= 0 ; i--) {
			if( teams.at(i) == teams.at(i + 1) ) {
				cout << "=" << teams.at(i).tID;
			} else {
				cout << "," << teams.at(i).tID;
			}
		}
		cout << endl;
 
    }
 
   // while(1){}
 
    return 0;
}

C++: #include <iostream>
#define MAX_TEAM 51
#define MAX_PROBLEM 11
using namespace std;

int main(){
	while(1){
		//penaltyTime[???????????????][????????????]:?????????????????????????????£???????????????0??????accept[???????????????]:??????????????£?§£??°???time[???????????????]:????????????????¨?????????????
		int penaltyTime[MAX_TEAM][MAX_PROBLEM]={};
		int accept[MAX_TEAM]={};
		int time[MAX_TEAM]={};
		//M:???????????????????????????T:???????????°???P:????????°???R:?¨??????°
		int M,T,P,R;
		cin>>M>>T>>P>>R;
		
		if(!(M+T+P+R)) break; //????????°????????????
		
		//??\????????????????????§??????
		for(int r=0;r<R;r++){
			//m:???????????????t:??????????????????p:???????????????j:?????????0:??£?§£???
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			if(j==0){
				accept[t]++;
				time[t]+=m+penaltyTime[t][p];
			}else{
				penaltyTime[t][p]+=20;
			}
		}
		
		//?????????????????§??????
		int acc=P;
		int count=0;
		while(1){ //????????£?§£??°????????????????????¨???
			int temp=0;
			bool isSame=false;
			if(acc<0 || count==T) break; //??£?§£??°0???????????????????????¨???????????¨?????????????????¨????????????????????????
			for(int j=1;j<=T;j++){ //????????????1??????????????????
				
				if(acc==accept[j]){
					if(temp==0){
						temp = j;
					}else if(time[temp]==time[j]){
						temp = j;
						isSame=true;
					}else if(time[temp]>time[j]){
						temp=j;
						isSame=false;
					}
				}
			}
			if(temp!=0){
				cout<<temp;
				count++;
				if(isSame){         //??????????????¨????????????????????¢???????????????????????´???=?¨????????????????
					cout<<"=";
				}else if(count!=T){ //??¨?????°?????????????????°??¨???????????´????¨???????????????????
					cout<<",";
				}else{
					cout<<endl;
				}
				accept[temp]=-1; //??¨?????????????????????????????£?§£??°???-1?????????
			}else{
				acc--; //?????¨??????????????£?§£??°???????????????????????????????????´?????????????????£?§£??°?????????
			}
		}
	}

	return 0;
}