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<vector>
#include<algorithm>
using namespace std;
struct team{
  int id,score,time,wrong[11];
  bool operator<(const team& a) const{
    return score == a.score ? (time == a.time ? id > a.id : time < a.time ) : score > a.score;
  }
};
int main(){
  int m,t,p,r,i,j,k;
  cin >> m >> t >> p >> r;
  while(m!=0){
    vector <team> teams;
    team te;
    for(j=0;j<11;j++) te.wrong[j]=0;
    te.score=0;
    te.time=0;
    for(i=1;i<=t;i++){
      te.id=i;
      teams.push_back(te);
    }
    int a,b,c,d;
    for(i=0;i<r;i++){
      cin >> a >> b >> c >> d;
      if(d==0){
	teams[b-1].score++;
	teams[b-1].time+=a+20*teams[b-1].wrong[c];
      }else{
	teams[b-1].wrong[c]++;
      }
    }
    sort(teams.begin(),teams.end());
    for(i=0;i<t;i++){
      if(i>0){
	if(teams[i-1].score==teams[i].score&&teams[i-1].time==teams[i].time) cout << "=";
	else cout << ",";
      }
      cout << teams[i].id;
    }
    cout << endl;
    cin >> m >> t >> p >> r;
  }
  return 0;
}

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

int main(){
	int M, T, P, R;

	cin >> M >> T >> P >> R;
	while(M != 0 || T != 0 || P != 0 || R != 0){
		int m, t, p, jx;
		int table[51][11][2];
		for(int i=0; i<51; i++){
			for(int j=1; j<11; j++){
				table[i][j][0] = 0;
				table[i][j][1] = -1;
			}
		}
		for(int i=0; i<R; i++){
			cin >> m >> t >> p >> jx;
			if(jx != 0){
				table[t][p][0] += 20;
			}else{
				table[t][p][0] += m;
			}
			table[t][p][1] = jx;
		}

		int ans[51];
		for(int i=1; i<=T; i++){
			ans[i] = 0;
		}
		for(int i=1; i<=T; i++){
			for(int j=1; j<=P; j++){
				if(table[i][j][1] == 0){
					ans[i] += (table[i][j][1]+1)*10000+(500-table[i][j][0]);
				}
			}
		}
	
		int max=0, maxp=0;	
		int tmp = 0;
		for(int j=1; j<=T; j++){
			for(int i=1; i<=T; i++){
				if(maxp <= ans[i]){
					maxp = ans[i];
					max = i;
				}
			}
			ans[max] = -1;
			if(j == 1){
				cout << max;
			}else{
				if(maxp == tmp){
					cout << '=' << max;
				}else{
					cout << ',' << max;
				}
			}
			tmp = maxp;
			maxp = -1;
		}
		cout << endl;
		cin >> M >> T >> P >> R;
	}
}

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

int m,t,p,r;
int zi,na,mo,ans;
int noa[52][12];
int acs[52];
int minu[52];
int check[52];
int o;
int num;

main(){
  while(cin >> m >> t >> p >> r, m||t||p||r){
    for(int i=1;i<=t;i++){
      for(int j=1;j<=p;j++){
        noa[i][j]=0;
      }
      acs[i]=0;
      minu[i]=0;
      check[i]=0;
    }

    for(int i=0;i<r;i++){
      cin >> zi >> na >> mo >> ans;
      if(ans==0){
        acs[na]++;
        minu[na]+=zi+noa[na][mo]*20;
      }
      else{
        noa[na][mo]++;
      }
    }

    for(int i=0;i<t;i++){
      num=-1;
      for(int j=t;j>0;j--){
        if(check[j]==0){
          if(num==-1){
            num=j;
          }
          else if(acs[num]<acs[j]){
            num=j;
          }
          else if(acs[num]==acs[j] && minu[num]>minu[j]){
            num=j;
          }
        }
      }
      if(i!=0){
        if(minu[num]==minu[o] && acs[num]==acs[o]){
          cout << "=";
        }
        else{
          cout << ",";
        }
      }
      cout << num;
      check[num]=1;
      o=num;
    }
    cout << endl;
  }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>

#define REP(i,n) for( int i = 0; i < n; i++ )


using namespace std;

/*
 より多くの問題に正解したチームを上位とする．
 正解した問題数が同じ場合は，所要時間合計の少ないチームを上位とする．
 複数のチームが同数の問題に正解し，所要時間合計も同じなら，それらのチームを同順位とする．
 */

struct team{
	int ans,time,name;
    int q[50]={0};
    
	team() : ans(0), time(0), name(0) {}
    
    bool operator <( const team& Right )const {
        return  ans != Right.ans ? ans < Right.ans :
        time != Right.time ? time > Right.time :
        name <  Right.name;
    }
};


int main()
{
	int M,T,P,R;
	// Mは，コンテストの始まりから終わりまでの時間である． Tは，チーム数である． Pは，問題数である． Rは，提出記録の数である
	while( cin >> M >> T >> P >> R )
	{
		int m,t,p,k;
		vector<team> team_array(T+1);
		if( T == 0 ) return 0;
		for( int i = 1; i <= T; i++)
			team_array[i].name = i;
		// mkは，経過時間である． tkは，チーム番号である． pkは，問題番号である． jkは，判定結果を表す（0なら正解，0以外なら不正解）
		REP(i,R)
		{
			cin >> m >> t >> p >> k;
			team &tm = team_array[t];
			if( !k ){
				tm.ans++;
				tm.time += m;
                if( tm.q[p] )
                    tm.time += 20 * tm.q[p];
			}
            else{
                tm.q[p]++;
            }
            
		}
		
        sort( team_array.begin() + 1 , team_array.end() );
		
        for( int i = T; i > 0; i-- )
        {
            char c;
            if( i == 1 ){
                cout << team_array[i].name << endl;
                continue;
            }
            else if ( team_array[i].ans == team_array[i-1].ans &&
                team_array[i].time == team_array[i-1].time) {
                c = '=';
            }
            else{
                c = ',';
            }
			cout << team_array[i].name << c;
        }
        
	}
	return 0;
}