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>
#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]={};
    
	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;
	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;
		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 <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 <vector>
#include <algorithm>
using namespace std;

struct team{
	int n, c, t, p;
};

bool operator<(const team team1, const team team2){
	bool rep;
	if(team1.c == team2.c){
		rep = (team1.t == team2.t) ? team1.n > team2.n : team1.t < team2.t;
	}else{
		rep = (team1.c > team2.c);
	}
	return rep;
}

int main(){
	int M, T, P, R;
	while( cin >> M >> T >> P >> R, M || T || P || R ){
		vector<team> teams(T);
		for(int i = 0; i < T; i++){
			teams[i].n = i+1;
			teams[i].c = 0;
			teams[i].t = 0;
			teams[i].p = 0;
		}
		for(int i = 0; i < R; i++){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if( j == 0 ){
				teams[t-1].c++;
				teams[t-1].t += m + 20 * teams[t-1].p;
				teams[t-1].p = 0;
			}else{
				teams[t-1].p++;
			}
		}
		sort(teams.begin(), teams.end());
		cout << teams[0].n;
		for(int i = 1; i < T; i++){
			if( teams[i].c == teams[i-1].c && teams[i].t == teams[i-1].t ) cout << "=";
			else cout << ",";
			cout << teams[i].n;
		}
		cout << endl;
	}
}