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>
using namespace std;

const int INF=50000000;

int data[51][12];

int main(){
	int M,T,P,R;
	while(cin>>M>>T>>P>>R && M){
		fill((int*)data,(int*)(data+12),0);
		for(int i=0;i<R;i++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			if(j==0){
				data[t][0]++;
				data[t][11]+=m+data[t][p]*20;
			}
			else data[t][p]++;
		}
		int prev[2]={INF,0};
		for(int i=0;i<T;i++){
			int ans=0;
			int now[2]={0,INF};
			for(int j=T;j>=0;j--){
				if(data[j][0]>now[0]){
					now[0]=data[j][0];
					now[1]=data[j][11];
					ans=j;
				}
				else if(data[j][0]==now[0] && data[j][11]<now[1]){
					now[1]=data[j][11];
					ans=j;
				}
			}
			if(i){
				if(memcmp(now,prev,sizeof(now))==0)cout<<"=";
				else cout<<",";
			}
			cout<<ans;
			memcpy(prev,now,sizeof(now));
			data[ans][0]=-1;
		}
		cout<<endl;
	}
}

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

typedef pair<int,int> pii;
typedef pair<pii,int> tri;
int main(){
  int m,t,p,r;
  int team[55][15];
  while(cin>>m>>t>>p>>r,m){
    memset(team,0,sizeof(team));
    vector<tri> ans;
    int a,b,c,d;
    for(int i=0;i<r;i++){
      cin>>a>>b>>c>>d;
      if(d!=0){
	team[b][c]++;
      }else{
	team[b][p+1]+=a+20*team[b][c];
	team[b][p+2]++;
      }
    }
    for(int i=1;i<=t;i++){
      ans.push_back(tri(pii(-team[i][p+2],team[i][p+1]),-i));
    }
    sort(ans.begin(),ans.end());
    for(int i=0;i<t;i++){
      cout<<-ans[i].second;
      if(i+1==t)cout<<endl;
      else if(ans[i].first == ans[i+1].first)cout<<"=";
      else cout<<",";
    }
  }
}

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

using namespace std;

typedef struct team {
    int name;
    int time, sol;
} team;

bool compt(const team & a, const team & b){
    if(a.sol != b.sol) return a.sol > b.sol;
    if(a.time != b.time) return a.time < b.time;
    return a.name > b.name;
}
bool eqt(const team & a, const team & b){
    return a.sol == b.sol && a.time == b.time;
}

int pena[51][11];
team teams[51];

int main(){
    int M,T,P,R;
    while(cin >> M >> T >> P >> R, M+T+P+R){
        memset(pena,0,sizeof(pena));
        memset(teams,0,sizeof(teams));
        for(int i=0; i<T; i++){
            teams[i].name = i+1;
        }
        for(int i=0; i<R; i++){
            int m,t,p,j;
            cin >> m >> t >> p >> j; t--;
            if(j == 0){ // ac
                teams[t].time += pena[t][p] + m;
                teams[t].sol++;
            } else { // wa
                pena[t][p] += 20;
            }
        }
        sort(teams, teams+T, compt);
        // for(int i=0; i<T; i++){
        //     cout << " " << teams[i].name << " "
        //          << teams[i].sol << " "
        //          << teams[i].time << endl;
        // }
        for(int i=0; i<T-1; i++){
            cout << teams[i].name;
            if(eqt(teams[i],teams[i+1])) cout << "=";
            else cout << ",";
        }
        cout << teams[T-1].name << endl;
    }
}