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 <stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,pair<int,int> > L;
int main(void) {
  P team[55][12];
  L mama[55];
  int M, T, Q, R;
  int m, t, p, j;
  while(1){
    memset(team,0,sizeof(team));
    memset(mama,0,sizeof(mama));
    scanf("%d %d %d %d", &M, &T, &Q, &R);
    if(M==0 & T==0) break;
    for ( int i = 0; i < R; i++ ) {
      scanf("%d%d%d%d",&m,&t,&p,&j);
      t--;
      if(j==0) team[t][p]=P(m+team[t][p].first,1);
      else team[t][p]=P(20+team[t][p].first,0);
    }

    for(int i=0;i<T;i++){
      for(int l=1;l<=Q;l++){
        if(team[i][l].second==1){
          mama[i].first--;
          mama[i].second.first+=team[i][l].first;
        }
      }

      mama[i].second.second= -i;
    }

    sort(mama,mama+T);

//    for(int i=0;i<T;i++) cout << "first :" << mama[i].first << "second.first :" << mama[i].second.first << "second.second :" << mama[i].second.second << endl;

    for(int i=0;i<T;i++){
    if(i==T-1) {
      printf("%d\n",-mama[i].second.second+1);
      break;
    }
    if(mama[i].first==mama[i+1].first && mama[i].second.first == mama[i+1].second.first){
      printf("%d=",-mama[i].second.second+1);
    }
    else  printf("%d,",-mama[i].second.second+1);
    }
    printf("\n");
  }

  return 0;
}

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

int main(){
  while(true){
    int M,T,P,R;
    cin>>M>>T>>P>>R;

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

    int CP[50],TT[50],PT[50][10];
    for (int i = 0; i < T; i++) {
        CP[i] = TT[i] = 0;
        for (int j = 0; j < P; j++)
            PT[i][j] = 0;
    }

    for (int i = 0; i < R; i++) {
        int m, t, p, j;
        cin >> m >> t >> p >> j;

        if (j == 0) {
            CP[t - 1]++;
            TT[t - 1] += (m + PT[t - 1][p - 1]);
        }
        else {
            PT[t - 1][p - 1] += 20;
        }
    }

    int tnow, tpre = -1;
    bool flg[50];
    for (int i = 0; i < T; i++)
        flg[i] = false;

    for (int i = 0; i < T; i++) {
        tnow = -1;
        for (int j = 0; j < T; j++) {
            if (flg[j])
                continue;

            if (tnow == -1) {
                tnow == j;
            }
            else {
                if (CP[j] > CP[tnow] || (CP[j] == CP[tnow] && TT[j]<=TT[tnow])) {
                    tnow = j;
                }
            }
        }

        if (tpre != -1) {
            if (CP[tnow] == CP[tpre] && TT[tnow] == TT[tpre])
                cout << '=';
            else
                cout << ',';
        }
        cout << tnow + 1;

        flg[tnow] = true;
        tpre = tnow;
    }
    cout << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)

int main(){
	while(1){
		int m,t,p,r;
		cin>>m>>t>>p>>r;
		if(m==0&&p==0&&t==0&&r==0) break;
		int score[51],stats[51][11],time[51];
		lp(i,51){
			score[i]=0;
			time[i]=0;
			lp(j,11){
				stats[i][j]=0;
			}
		}
		lp(i,r){
			int a,b,c,d;
			cin>>a>>b>>c>>d;
			if(d!=0){
				stats[b][c]++;
			}
			else{
				score[b]++;
				time[b]+=a+stats[b][c]*20;
			}
		}
		tuple<int,int,int> ans[50];
		lp(i,t){
			ans[i]=make_tuple(score[i+1],-time[i+1],i+1);
		}
		sort(ans,ans+t);
		reverse(ans,ans+t);
		int ans1,memo,memo2,memo3,memo4;
		lp(i,t){
			ans1=get<2>(ans[i]);
			memo=get<0>(ans[i]);
			memo3=get<1>(ans[i]);
			if(i==0){
				cout<<ans1;
			}
			else{
				if(memo==memo2&&memo3==memo4){
					cout<<"=";
				}
				else cout<<",";
				cout<<ans1;
			}
			memo2=memo;
			memo4=memo3;
		}
		cout<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
using namespace std;
typedef tuple<int,int,int> T3;
int cnt[50];
int tt[50];
int penalty[50][10];


int main(){
    int M,T,P,R;
    while(cin>>M>>T>>P>>R,M){
        fill(cnt,cnt+50,0);
        fill(tt,tt+50,0);
        fill(penalty[0],penalty[50],0);
        for(int i=0;i<R;i++){
            int m,t,p,j;
            cin>>m>>t>>p>>j;
            t--; p--;
            if(j){
                penalty[t][p]+=20;
            }else{
                cnt[t]++;
                tt[t]+=penalty[t][p]+m;
            }
        }
        vector<T3> V;
        for(int i=0;i<T;i++){
            V.emplace_back(cnt[i],-tt[i],i+1);
        }
        sort(V.begin(), V.end(),greater<T3>());
        for(int i=0;i<T;i++){
            if(i){
                int c1,c2,tt1,tt2,i1,i2;
                tie(c1,tt1,i1)=V[i-1];
                tie(c2,tt2,i2)=V[i];
                if(c1==c2&&tt1==tt2){
                    cout<<'=';
                }else{
                    cout<<',';
                }
            }
            cout<<get<2>(V[i]);
        }
        cout<<endl;        
    }

}