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 <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#include <map>
#include <set>

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;

#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back
#define sz size()

class TEAM{
public:
    int pena[20]={};
    int sum=0;
    int time=0;
    int num=0;
    int point=0;
};

int main(){
    int M,T,P,R;
    while(cin>>M>>T>>P>>R){
        TEAM team[100];
        
        
        if(M==0 && T==0 && P==0 && R==0)break;
        
        rep(i,T)team[i].num=i+1;
        
        rep(i,R){
            int m,t,p,j;
            cin>>m>>t>>p>>j;
            t--;
            if(j==0){
                team[t].sum++;
                team[t].time+=m+team[t].pena[p]*20;
            }else{
                team[t].pena[p]++;
            }
        }
        
        rep(i,T){
            team[i].point=team[i].sum*100000000 + 10000000-team[i].time;
        }

        for(int i=0;i<T-1;i++){
            for(int j=T-1;j>i;j--){
                if(team[j].point<team[j-1].point)swap(team[j],team[j-1]);
            }
        }
        
        cout<<team[T-1].num;
//        cout<<" "<<team[T-1].point<<endl;
        for(int i=T-2;i>=0;i--){
            if(team[i+1].point==team[i].point){
                cout<<"="<<team[i].num;
//                cout<<" "<<team[i].point<<endl;
            }
            else{
                cout<<","<<team[i].num;
//                cout<<" "<<team[i].point<<endl;
            }
        }
        cout<<endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

bool comp(pair<pair<int,int>,int> p1, pair<pair<int,int>,int> p2){

    if(p1.first.first == p2.first.first){
        if(p1.first.second == p2.first.second){
            return p1.second < p2.second;
        }
        return p1.first.second > p2.first.second;
    }
    return p1.first.first < p2.first.first;

}

int main() {

    while(1) {

        int M,T,P,R;

        cin >> M >> T >> P >> R;

        if(M == 0 && T == 0 && P == 0 && R == 0) break;

        pair<int,int> team[T+1]; //solve_num, time
        pair<bool,int> try_progrums[T+1][P]; //is_tried, tried_count

        team[0] = make_pair(-1,-1);

        for(int i=1; i<T+1; i++){
            team[i] = make_pair(0,0);
            for(int j=0; j<P; j++) {
                try_progrums[i][j] = make_pair(false, 0);
            }
        }

        for(int i=0; i<R; i++){

            int m, t, p, j;

            cin >> m >> t >> p >>j;

            if(j == 0){
                team[t].first++;
                team[t].second += m + try_progrums[t][p].second * 20;
            }
            else{
                try_progrums[t][p].first = true;
                try_progrums[t][p].second++;

            }
        }

        pair<pair<int,int>,int> team_result[T+1];

        for(int i=0; i<T+1; i++){
            team_result[i] = make_pair(make_pair(team[i].first,team[i].second),i);
        }

        sort(team_result,team_result+T+1,comp);

        cout << team_result[T].second;

        for(int i=T; i>1; i--){
            if(team_result[i].first.first == team_result[i-1].first.first && team_result[i].first.second == team_result[i-1].first.second){
                cout << '=' << team_result[i-1].second;
            }
            else{
                cout << ',' << team_result[i-1].second;
            }
        }

        cout << endl;




    }
    return 0;
}