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<algorithm>
#include<functional>
#include<vector>
#include<string>
#include<map>
#include<queue>
using namespace std;
#define REP(i, a, n) for(int i=a; i<n; i++)
#define RREP(i, a, n) for(int i=n-1; i>=a; i--)
#define INF 1000000000
#define MP(a, b) make_pair(a, b)
#define F first
#define S second

int main() {
	int M, T, P, R;
	while (cin >> M >> T >> P >> R) {
		vector<pair<int, pair<int, int>>> vp;  // correct, time, team
		int pena[51][11];

		REP(i, 0, T) vp.push_back(MP(0, MP(0, i + 1)));
		REP(i, 0, 51) REP(j, 0, 11) pena[i][j] = 0;

		REP(i, 0, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			p--;

			if (j == 0) {
				vp[t].F++;
				vp[t].S.F -= (pena[t][p] + m);
			}
			else {
				pena[t][p] += 20;
			}
		}

		sort(vp.begin(), vp.end());
		reverse(vp.begin(), vp.end());

		cout << vp[0].S.S;
		REP(i, 1, vp.size()) {
			if (vp[i - 1].F > vp[i].F) {
				cout << "," << vp[i].S.S;
			}
			else if (vp[i - 1].S.F > vp[i].S.F) {
				cout << "," << vp[i].S.S;
			}
			else {
				cout << "=" << vp[i].S.S;
			}
		}

		cout << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
const int MAX_T = 51;
const int MAX_P = 11;
typedef pair<int,int> PP;
typedef pair<PP,int> P;

int main(){
  int m,t,p,r,team[MAX_T][MAX_P],judge[MAX_T][MAX_P];
  int mi,ti,pi,ji,accnt[MAX_T];

  while(cin >> m >> t >> p >> r , m + t + p + r){
    vector<P> v;
    fill(team[0],team[MAX_T],0);
    fill(judge[0],judge[MAX_T],0);
    fill(accnt,accnt+MAX_T,0);

    for(int i = 0 ; i < r ; i++){
      cin >> mi >> ti >> pi >> ji;
      if(ji == 0){
	team[ti][pi] += mi + judge[ti][pi];
	accnt[ti]--;
      }
      else{
	judge[ti][pi] += 20;
      }
    }
    int tt[MAX_T] = {0};
    for(int i = 1 ; i < MAX_T ; i++){
      for(int j = 1 ; j < MAX_P ; j++){
	tt[i] += team[i][j];
      } 
    }
    for(int i = 1 ; i <= t ; i++){
	v.push_back(P(PP(accnt[i],tt[i]),-i));
    }
    sort(v.begin(),v.end());
    for(int i = 1 ; i <= v.size() ; i++){
      if(v[i-1].first.first < v[i].first.first){
	cout << -v[i-1].second;
	if(i != v.size()) cout << ',';
      }
      else{
	if(v[i-1].first.second < v[i].first.second){
	  cout << -v[i-1].second;
	  if(i != v.size()) cout << ',';
	}
	else{
	  cout << -v[i-1].second;
	  if(i != v.size()) cout << '=';
	}
      }
    }
    cout << endl;
  }

  return 0;
}

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

int main(){
	while(1){
		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[tpre]<=TT[tnow]){
					cout<<'=';
				}
				else{
					cout<<'.';
				}
			}
			cout<<tnow+1;
		
			flg[tnow]=true;
			tpre=tnow;
		}
		cout<<endl;
	}
	
	return 0;
}

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

typedef pair<int,int> pii;
typedef pair<pii,int> tri;
int main(){
  int m,t,p,r;
  int team[55][15];
  while(cin>>m>>t>>p>>r,m){
    memset(team,0,sizeof(team));
    vector<tri> ans;
    int a,b,c,d;
    for(int i=0;i<r;i++){
      cin>>a>>b>>c>>d;
      if(d!=0){
	team[b][c]++;
      }else{
	team[b][p+1]+=a+20*team[b][c];
	team[b][p+2]++;
      }
    }
    for(int i=1;i<=t;i++){
      ans.push_back(tri(pii(-team[i][p+2],team[i][p+1]),-i));
    }
    sort(ans.begin(),ans.end());
    for(int i=0;i<t;i++){
      cout<<-ans[i].second;
      if(i+1==t)cout<<endl;
      else if(ans[i].first == ans[i+1].first)cout<<"=";
      else cout<<",";
    }
  }
}