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<fstream>
#include<vector>

using namespace std;

int main(){
	
	//ifstream fin;
	//fin.open("input.txt");

	int M, T, P, R;//input
	int m, t, p, j;//input

	int time[50];	//経過時間
	int solve[50];	//正解数
	int miss[50][10];	//間違えた数
	int count;
	vector<int> v,s;//解けた問題数ごとに...
	
	while(true){
		for (int i = 0; i < 50; i++){//初期化
			for (int k = 0; k < 10; k++)miss[i][k] = 0;
			time[i] = solve[i] = 0;
		}
		M = T = P = R = m = t = p = j = 0;

		cin >> M >> T >> P >> R;
		if (M == 0)break;

		while (R > 0){//結果計算
			R--;
			cin >> m >> t >> p >> j;
			t--;
			if (j == 0){
				time[t] += m;
				time[t] += miss[t][p] * 20;
				solve[t]++;
			}
			else miss[t][p]++;
		}
		/*
		for (int i = 0; i < T; i++){
			cout << "チーム" << i+1 << endl << " 経過時間：" << time[i] << " 回答数：" << solve[i];
			cout << endl;
		}
		*/

		//以下ソート
		count = 0;//初期化
		for (int i = 0; i < T; i++)if (count < solve[i])count = solve[i];


		while (count >= 0){
			for (int i = 0; i < T; i++)if (count == solve[i]){
				v.push_back(i);//countだけ解けたチームを記憶
				s.push_back(time[i]);//解けたチームの時間を記憶
			}

			//バブルソート
			if (s.size() > 1){
				for (int i = 0; i < (int)v.size() - 1; i++)
					for (int k = (int)v.size() - 1; k > i; k--){
						if (s[k] > s[k - 1]){
							int tmp = s[k];
							int temp = v[k];

							s[k] = s[k - 1];
							v[k] = v[k - 1];
							
							s[k - 1] = tmp;
							v[k - 1] = temp;
						}
					}
			}
			if (v.size() > 1){
				for (int i = 0; i < (int)v.size() - 1; i++)
					for (int k = (int)v.size() - 1; k > i; k--)
						if (s[k] == s[k - 1] && v[k] < v[k - 1]){
							int tmp = v[k];
							v[k] = v[k - 1];
							v[k - 1] = tmp;
						}
			}
			//ソート終了

			//output
			while (v.size() > 2){
				if (s[v.size() - 1] == s[v.size() - 2] || s[v.size()] == s[v.size() - 1])
					cout << v.back()+1 << '=';
				else cout << v.back()+1 << ",";
				v.pop_back();
			}
			if (v.size() == 2){//最後の二つだけ例外処理

				if (s[1] == s[0])
					 cout << v.back()+1 << "=";
				else cout << v.back()+1 << ',';
					v.pop_back();
					cout << v.back()+1;
					if (s[v.size()-1] != 0)cout << ',';
					v.pop_back();
			}
			if (v.size() == 1){
				cout << v.back()+1 << ',';
				v.pop_back();
			}
			v.clear();
			s.clear();
			count--;
		}
		cout << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
struct team{
	int num,p,cnt;
	int w[11];
	void init(int n)
	{
		num=n;
		p=0;
		cnt=0;
		for(int i=0;i++<10;)w[i]=0;
	}
	void submit(int m,int i,int j)
	{
		if(j)w[i]++;
		else p+=m+w[i]*20,cnt++;
	}
	bool operator<(team a)
	{
		if(cnt!=a.cnt)return cnt>a.cnt;
		else if(p!=a.p)return p<a.p;
		else return num>a.num;
	}
	bool operator==(team a)
	{
		return cnt==a.cnt&&p==a.p;
	}
};
int M,T,P,R;
main()
{
	while(cin>>M>>T>>P>>R,M)
	{
		team a[55];
		for(int i=0;i++<T;)a[i].init(i);
		for(int i=0;i<R;i++)
		{
			int b,c,d,e;cin>>b>>c>>d>>e;
			a[c].submit(b,d,e);
		}
		sort(a+1,a+T+1);
		for(int i=0;i++<T;)
		{
			if(i==1)cout<<a[i].num;
			else
			{
				cout<<(a[i-1]==a[i]?"=":",")<<a[i].num;
			}
		}
		cout<<endl;
	}
}

C++: #include <bits/stdc++.h>
#define REP(a,b,c) for(int a=b; a<(int)c; a++)
#define REPE(a,b,c) for(int a=b; a<=(int)c; a++)
#define REPD(a,b,c) for(int a=b; a>(int)c; a--)
#define rep(a,b) REP(a,0,b)
#define repd(a,b) REPD(a,b,0)
class _datas{
public:
  int m;
  int t;
  int p;
  int j;
};
class _score{
public:
  int p;
  int t;
  _score(int p, int t){
    this->p = p;
    this->t = t;
  }
};
typedef long long int ll;
using namespace std;

  

int main(){
  while(true){
    int M,T,P,R;
    cin >> M >> T >> P >> R;
    if(M == 0) break;
    vector<_datas> datas(R);
    rep(i,R) cin >> datas[i].m >> datas[i].t >> datas[i].p >> datas[i].j;
    //rep(i,R) cout << datas[i].m << " "<< datas[i].t << " "<< datas[i].p << " "<< datas[i].j << " " << endl;
    vector<_score> scores(T+1,_score(0,0));
    REPE(i,1,T){
      vector<int> miss_cnt(P+1,0);
      rep(j,R){
        _datas data = datas[j];
        if(data.t == i){
          if(data.j == 0){
            scores[i].p++;
            scores[i].t += data.m + miss_cnt[data.p]*20;
          }else{
            miss_cnt[data.p]++;
          }
        }
      }
    }
    /*cout << "score" << endl;
    REPE(i,1,T){
      cout<<i<<":" << scores[i].p << " " << scores[i].t << endl;
      }*/
    _score b_score = _score(0,0);
    REPE(i,1,T){
      int max_idx = 1;
      REPE(j,2,T){
        if(scores[j].p > scores[max_idx].p || (scores[j].p==scores[max_idx].p && scores[j].t <= scores[max_idx].t)){
          max_idx = j;
        }
      }
      if(i != 1){
        if(b_score.p == scores[max_idx].p && b_score.t==scores[max_idx].t) cout << "=";
        else cout << ",";
      }
      cout << max_idx;
      b_score = scores[max_idx];
      scores[max_idx] = _score(-1,0);
    }
    cout << endl;
  }
  return 0;
}