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 <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;

#define rep(i, j) for(int i= 0; i < j;i++)
#define all(i) i.begin(), i.end()

struct team { int num, ac, time; };

// t0<t1
bool compare(team &t0, team &t1)
{
	if (t0.ac == t1.ac) 
	{
		if (t0.time == t1.time){ return t0.num < t1.num; }
		return t0.time > t1.time; 
	}
	return t0.ac < t1.ac;
}
int main()
{
	int M, T, P, R;
	while (cin >> M >> T >> P >> R && (M != 0 && T != 0))
	{
		vector<int> m(R, 0), t(R, 0), p(R, 0), j(R, 0);
		vector<team> dat(T + 10);
		vector<vector<int>> wa(T + 10, vector<int>(P + 10, 0));
		rep(i, R)
		{
			int tmp[4] = { 0 };
			cin >> tmp[0] >> tmp[1] >> tmp[2] >> tmp[3];
			if (tmp[3] > 0) { wa[tmp[1]][tmp[2]] += 20; }
			else if(tmp[3] == 0)
			{
				dat[tmp[1]].time += tmp[0] + wa[tmp[1]][tmp[2]];
				dat[tmp[1]].ac += 1;
				dat[tmp[1]].num = tmp[1];
			}
		}
		rep(i, T + 1) { dat[i].num = i; }
		sort(dat.rbegin(), dat.rend(), compare);
		rep(i, T)
		{
			if (i == T - 1){ printf("%d\n", dat[i].num); }
			else if(dat[i].time == dat[i+1].time && i != T - 1){ printf("%d=", dat[i].num); }
			else{ printf("%d,", dat[i].num); }
		}
	}
}

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;
}

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

struct info{
	int ac, pn, id;
	vector<int> wa;

	info(): ac(0), pn(0), id(0) {}

	bool operator< (const info &i) const{
		if(ac != i.ac){ return ac < i.ac; }
		if(pn != i.pn){ return pn > i.pn; }
		return id < i.id;
	}
};

int main(){
	int T, P, R;
	int m, t, p, j;
	while(scanf("%*d%d%d%d", &T, &P, &R), T){
		vector<info> team(T + 1);
		for(int i = 1; i <= T; ++i){
			team[i].wa.assign(P + 1, 0);
			team[i].id = i;
		}
		
		for(int i = 0; i < R; ++i){
			scanf("%d%d%d%d", &m, &t, &p, &j);
			info &tm = team[t];
			if(j == 0){
				++tm.ac;
				tm.pn += m + 20 * tm.wa[p];
			}
			else{
				++tm.wa[p];
			}
		}
		
		sort(team.begin() + 1, team.end());
		for(int k = T; k > 0; --k){
			char ch = ',';
			if(k == 1){
				ch = '\n';
			}
			else if(team[k].ac == team[k - 1].ac && team[k].pn == team[k - 1].pn){
				ch = '=';
			}
			printf("%d%c", team[k].id, ch);
		}
	}
}

C++: #include<bits/stdc++.h>
#define f first 
#define sf second.first 
#define ss second.second 
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P > iP;

int main(){
  int t,p,r,b;
  while(cin>>b>>t>>p>>r&&t){
    iP a[51];
    int k[11][51]={};
    a[0]=iP(-1,P(-1,-1));
    for(int i=1;i<=t;i++)a[i]=iP(0,P(0,i));
    for(int i=0;i<r;i++){
      int ti,pi,m,s;
      cin>>m>>ti>>pi>>s;
      if(!s)a[ti].f++,a[ti].sf-=m+k[pi][ti]*20;
      else k[pi][ti]++;
    }
    sort(a+1,a+t+1);
    for(int i=t;i>0;i--){
      cout<<a[i].ss;
      if(i!=1)
	if(a[i+1].f==a[i].f&&a[i+1].sf==a[i].sf)cout<<"=";
	else cout<<",";
    }
    cout<<endl;
  }
  return 0;
}