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 <algorithm>

using namespace std;

int main() {
	int M, T, P, R;
	while (cin >> M >> T >> P >> R) {
		if (M == 0 && T == 0 && P == 0 && R == 0) {
			break;
		}
		int m, t, p, j;
		int tm[50][10] = {0};
		int sol[50][3] = {0};

		for (int i = 0; i < T; i++) {
			sol[i][2] = i+1;
		}

		for (int i = 0; i < R; i++) {
			cin >> m >> t >> p >> j;
			t -= 1;
			p -= 1;
			if (j != 0) {
				tm[t][p] += 20;
			} else {
				tm[t][p] += m;
				sol[t][0]++;
				sol[t][1] += tm[t][p];
			}
		}

		/*for (int i = 0; i < T; i++) {
	//		cout << sol[i][0] << " " << endl;
		}*/

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

C++: #include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
typedef pair<int,int> pi;
typedef pair<pi,int> ppii;
#define F first
#define S second
#define PB push_back
const int N=1e2+10;
bool cmp(ppii a,ppii b){
    if(a.F.F==b.F.F){
        if(a.F.S==b.F.S)return a.S>b.S;
        return a.F.S<b.F.S;
    }
    return a.F.F>b.F.F;
}
int main(){
    int m,t,p,q,a,b,c,d,add[N][N];
    ppii ans[N];
    while(true){
        scanf("%d%d%d%d",&m,&t,&p,&q);
        if(m==0&&q==0&&t==0&&p==0)return 0;
        for(int i=1;i<=t;i++)for(int j=1;j<=q;j++)add[i][j]=0;
        for(int i=1;i<=t;i++)ans[i]={{0,0},i};
        while(q--){
            scanf("%d%d%d%d",&a,&b,&c,&d);
            if(d!=0)add[b][c]+=20;
            else {
                ans[b].F.S+=add[b][c]+a;
                ans[b].F.F++;
            }
        }
        sort(ans+1,ans+1+t,cmp);
        printf("%d",ans[1].S);
        for(int i=2;i<=t;i++){
            if(ans[i].F==ans[i-1].F)printf("=");
            else printf(",");
            printf("%d",ans[i].S);
        }
        printf("\n");    
    }
}