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;

class Question{
public:
    bool isAC;
    int p;

    Question() : isAC(false),p(0){}
};
class Team{
public:
    int ID;
    int AC;
    int ptime;
    vector<Question> q;

    Team() : ID(-1), q(11), ptime(0), AC(0) {}
    Team(int id)
        : ID(id), q(11) , ptime(0), AC(0)
    {
    }

    void submit(int m,int p,int j){
        if(j == 0){
            q[p].p += m;
            q[p].isAC = true;
            AC++;
            ptime += q[p].p;
        }else{
            q[p].p += 20;
        }
    }
};

bool operator==(const Team& a,const Team& b){
    return a.AC == b.AC && a.ptime == b.ptime;
}
bool operator!=(const Team& a,const Team& b){
    return !(a == b);
}

//M:テァツオツづ、ツコツ?ヲツ卍づゥツ鳴?
//T:テ」ツδ?」ツδシテ」ツδ?ヲツ閉ー
//P:テ・ツ閉湘ゥツ。ツ古ヲツ閉ー
//R:テヲツ渉静・ツ?コテヲツ閉ー
void solve(int M,int T,int P,int R){
    vector<Team> team;
    for(int i=1;i<=T;i++){
        team.push_back(Team(i));
    }
    for(int i=0;i<R;i++){
        int m,t,p,j;
        cin >> m >> t >> p >> j;
        team[t-1].submit(m,p,j);
    }
    std::sort(team.begin(),team.end(),
            [](const Team& a,const Team& b)->bool{
                if(a.AC < b.AC)
                    return true;
                if(a.AC > b.AC)
                    return false;
                if(a.ptime > b.ptime)
                    return true;
                return a.ID < b.ID;
            }
            );
    std::reverse(team.begin(),team.end());
    bool f = false;
    //for(auto t : team)
    //{
    //    cout << t.ID << " :" << t.AC << " ," << t.ptime << endl;
    //}
    cout << team[0].ID;
    for(int i=1;i<T;i++){
        if(team[i-1] == team[i]){
            cout << "=" << team[i].ID;
        }else{
            cout << "," << team[i].ID;
        }
    }
    cout << endl;
}

int main(){
    while(true){
        int M,T,P,R;
        cin >> M >> T >> P >> R;
        if(!M&&!T&&!P&&!R)
            return 0;
        solve(M,T,P,R);
    }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
typedef pair<int,int> P;
typedef pair<P,int> Q;
#define fi first
#define sc second
int num[105],len[105];
int cnt[105][105];
int m,t,p,r;

int main(){
	while(1){
		cin>>m>>t>>p>>r;
		if(m == 0) return 0;
		rep(i,105)rep(j,105){
			num[i] = len[i] = cnt[i][j] = 0;
		}
		rep(i,r){
			int a,b,c,d; cin>>a>>b>>c>>d; b--;
			if(d != 0){
				cnt[b][c]++;
			}
			else{
				num[b]++;
				len[b] += a+cnt[b][c]*20;
			}
		}
		vector<Q>vec;
		rep(i,t) vec.push_back(Q(P(num[i],-len[i]),i));
		sort(vec.begin(),vec.end(),greater<Q>());
		for(int i=0;i<vec.size();i++){
			cout << vec[i].sc+1 ;
			if(i != vec.size()-1){
				if(vec[i].fi == vec[i+1].fi) cout << "=" ;
				else cout << "," ;
			}
		}
		cout << endl;
	}
}

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],YY[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++){
q			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;
}