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<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<string>
using namespace std;
struct team{int m;
                   int t;
                   int p;
                   int j;
                   };
int A[100000];
vector<int>G;
int main(){
	int M,T,P,R;
	vector<pair<int,int> > sum;
	cin>>M;
	cin>>T;
	cin>>P;
	cin>>R;
	int ms[R];
    team A[R];
    for(int i=0;i<R;i++){
		scanf("%d%d%d%d",&A[i].m,&A[i].t,&A[i].p,&A[i].j);
	}
	for(int i=0;i<T;i++){
		sum.push_back(make_pair(0,i));
	}
	for(int i=0;i<T;i++){
		ms[i]=0;
		for(int k=0;k<R;k++){
			if(A[k].t==i){
				ms[i]+=A[i].m;
				if(A[k].j==0){
					sum[i].first+=1;
				}
			}
		}
	}
	sort(sum.begin(),sum.end());
    for(int i=0;i<T;i++){
    	if(i>0){
    	if(sum[i]==sum[i-1]){
    		printf("=");
    	}
    	else{
    		printf(" ");
    	}
    	}
    	printf("%d",sum[i].second);
    }
   }

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

#define SUBMIT_MAX 2000

#define TEAM_MAX 50
#define PROBLEM_MAX 10

void score_sort(int score[TEAM_MAX][3], int T) {
    int temp[3];
    for(int i=0; i<T; i++) {
        for (int j=T-1; j>i; j--) {
            if (score[j-1][1] < score[j][1] ||
                (score[j-1][1] == score[j][1] && score[j-1][2] > score[j][2]) ||
                (score[j-1][1] == score[j][1] && score[j-1][2] == score[j][2] && score[j-1][0] < score[j][0])
                ) {
                temp[0] = score[j][0];
                temp[1] = score[j][1];
                temp[2] = score[j][2];
                score[j][0] = score[j-1][0];
                score[j][1] = score[j-1][1];
                score[j][2] = score[j-1][2];
                score[j-1][0] = temp[0];
                score[j-1][1] = temp[1];
                score[j-1][2] = temp[2];
            }
        }
    }
}

int main(void) {
    int M, T, P, R;
    int m[SUBMIT_MAX], t[SUBMIT_MAX], p[SUBMIT_MAX], j[SUBMIT_MAX];
    int score[TEAM_MAX][3];
    int accepted_flag[TEAM_MAX][PROBLEM_MAX];
    while (cin >> M >> T >> P >> R, M && T && P) {
        for(int i=0; i<T; i++) {
            score[i][0] = i+1;
            score[i][1] = 0;
            score[i][2] = 0;
            for(int j=0; j<P; j++) {
                accepted_flag[i][j] = 0;
            }
        }
        for(int i=0; i<R; i++) {
            cin >> m[i] >> t[i] >> p[i] >> j[i];
            if (i == R-1) {
                //cout << m[R-1] << " " << t[R-1] << " " << p[R-1] << " " << j[R-1] << endl;
            }
            t[i]--;
            p[i]--;
        }
        for(int i=0; i<R; i++) {
            if (j[i] == 0) {
                accepted_flag[t[i]][p[i]] = 1;
            }
        }
        for(int i=0; i<R; i++) {
            if (j[i] != 0 && accepted_flag[t[i]][p[i]]) {
                score[t[i]][2] += 20;
            }
            if (j[i] == 0) {
                score[t[i]][2] += m[i];
                score[t[i]][1] += 1;
            }
        }
        score_sort(score, T);
        for(int i=0; i<T; i++) {
            //cout << "[" << score[i][0] << " " << score[i][1] << " " << score[i][2] << "]" << endl;
        }
        for(int tmp1, tmp2, i=0; i<T; i++) {
            if (i!=0) {
                if (tmp1 == score[i][1] && tmp2 == score[i][2]) { cout << "="; } else { cout << ","; }
            }
            cout << score[i][0];
            tmp1 = score[i][1];
            tmp2 = score[i][2];
        }
        cout << endl;
        //sort(score, score + T, [](const int a[3], const int b[3]) { return a[0] > b[0];});
    }
    return 0;
}

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

typedef struct {
  int ch[11];
  int num;
  int time;
  int tnum;
} lg;
int M,T,R,P;
vector<lg> team;

bool asc(lg t1,lg t2);

int main(){
  int i,j,m,t,p;

  for(i=0;i<51;i++){
    lg x;
    team.push_back(x);
  }
  while(1){
    cin >> M >> T >> P >> R;
    if(M==0&&T==0&&P==0&&R==0)break;
    for(i=0;i<=T;i++){
      team[i].num=0;
      team[i].time=0;
      team[i].tnum=i+1;
      for(j=0;j<=P;j++)team[i].ch[j]=0;
    }
    for(i=0;i<R;i++){
      cin >> m >> t >> p >> j;
      if(j!=0)team[t-1].ch[p]++;
      else{
	team[t-1].time+=20*team[t-1].ch[p];
	team[t-1].num++;
	team[t-1].time+=m;
      }
    }

    sort(team.begin(),team.begin()+T,asc);

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

bool asc(lg t1,lg t2){
  if(t1.num>t2.num)return 1;
  else if(t1.num==t2.num&&t1.time<t2.time)return 1;
  else if(t1.num==t2.num&&t1.time==t2.time&&t1.tnum>t2.tnum)return 1;
  else return 0;
}