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++: a#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], 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[tnow]==TT[tpre])
                    cout << '=';
                else
                    cout << ',';
            }
            cout << tnow+1;
 
            flg[tnow] = true;
            tpre = tnow;
        }
        cout << endl;
    }
 
    return 0;
}

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

using namespace std;

typedef pair< int, int> pii;
typedef pair< int, pii> piii;

int M, T, P, R;

int main() {
	while (1) {
		cin >> M >> T >> P >> R; if (M==0 && T==0 && P==0 && R==0) break;
		
		vector<piii> pv(T);
		vector< vector<bool> > end(T, vector<bool>(P, false) );
		for (int i = 0; i < T; i++) pv[i] = make_pair(0, make_pair(0, i + 1) );
		for (int i = 0; i < R; i++) {
			int m, t, p, j; cin >> m >> t >> p >> j;
			if (end[t-1][p-1]) continue;
			if (j==0) {
				pv[t-1].first++;
				pv[t-1].second.first -= m;
				end[t-1][p-1] = true;
			} else {
				pv[t-1].second.first -= 20;
			}
		}

		sort(pv.begin(), pv.end());
		for (int i = T-1; i >= 0; i--) {
			if (i > 0 && pv[i].first == pv[i-1].first && pv[i].second.first == pv[i-1].second.first) {
				cout << pv[i].second.second << "=";
			} else {
				cout << pv[i].second.second;
				if (i > 0) cout << ",";
			}
		}
		cout << endl;
	}	

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <map>

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;

		vector < vector<int> > mt(t, vector<int>() );
		vector < vector<int> > pt(t, vector<int>() );
		vector < vector<int> > jt(t, vector<int>() );

		for (int i=0;i<r;i++)
		{
			int M,T,P,J;
			cin >> M >> T >> P >> J;
			mt[T-1].push_back(M);
			pt[T-1].push_back(P);
			jt[T-1].push_back(J);
		}
		
		multimap <int,int> rank;

		for (int i=0;i<t;i++)
		{
			int SC=0,PT=0;
			vector <bool> solved(p);
			for (int j=mt[i].size()-1;j>=0;j--)
			{
				if(!solved[pt[i][j]])
				{
					if(jt[i][j]==0)
					{
						solved[pt[i][j]]=true;
						SC++;
						PT+=mt[i][j];
					}
				}else{
					PT+=20;
				}
			}
			pair <int, int> PAIR;
			PAIR.first = (-(SC*5000000)+PT)*50-i;
			PAIR.second = i;
			rank.insert(PAIR);
		}
		
		for (multimap<int, int>::iterator i=rank.begin();i!=(--rank.end());i++)
		{
			cout << i->second + 1 << ((((i->first)+(i->second))==(((++i)->first)+((i)->second)))?"=":",");
			i--;
		}
		cout << (--rank.end())->second + 1 << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
 
using namespace std;

class team{
public:
	int ac,pe,num;
	vector<int> wa;
	team(int n){
		ac=0;pe=0;
		wa=vector<int>(n);
	}

	bool operator<(const team& t) const{
		return ac<t.ac || ac==t.ac && pe>t.pe;
	}
	bool operator==(const team& t) const{
		return ac==t.ac && pe==t.pe;
	}

};

int main()
{

	int M,T,P,R;
	while(cin>>M>>T>>P>>R,M){
		vector<team> vt(T,team(P));
		for(int i=0;i<T;i++) vt[i].num=i+1;
		for(int i=0;i<R;i++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;

			if(j){
				vt[t-1].wa[p-1]++;
			}else{
				vt[t-1].ac++;
				//vt[t-1].last=m;
				vt[t-1].pe+=m+vt[t-1].wa[p-1]*20;
			}
		}
		sort(vt.begin(),vt.end());
		reverse(vt.begin(),vt.end());


		for(int i=0;i<vt.size()-1;i++){
			cout<<vt[i].num;
			if(vt[i]==vt[i+1]) cout<<"=";
			else cout<<",";
		}
		cout<<vt.back().num<<endl;
	}

	return 0;
}