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>
#define INF 1000000
using namespace std;

bool flag[51];
int M,T,P,R;

bool check(){
	for(int i=1;i<=T;i++)
		if(flag[i])
			return true;
	return false;
}

int main(void){
	while(cin >> M >> T >> P >> R,M|T|P|R){
		for(int i=1;i<=T;i++)
			flag[i]=true;
		int cor[51]={0};
		int time[51]={0};
		int pe[51][11]={0};
		int m,t,p,j;
		for(int i=0;i<R;i++){
			cin >> m >> t >> p >> j;
			if(j){
				pe[t][p]++;
			}else{
				cor[t]++;
				time[t]+=m;
				time[t]+=pe[t][p]*20;
			}
		}
		int o=0;
		while(check()){
			cout << (o? ",":"");
			o++;
			int correct=0,less=INF;
			for(int i=T;i>=1;i--){
				if(!flag[i])
					continue;
				if(cor[i]>correct)
					correct=cor[i],less=time[i];
				else if(correct==cor[i]&&less>time[i])
					less=time[i];
			}
			int d=0;
			for(int i=T;i>=1;i--){
				if(!flag[i])
					continue;
				if(correct==cor[i]&&time[i]==less)
					cout << (d?"=":"") << i,d++,flag[i]=false;
			}
		}
		cout << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

int main(){
	vector<pair<int,pair<int,int>>>v;
	for(int i=1;i<150;++i){
		for(int j=i+1;j<=150;++j){
			v.push_back(make_pair(i*i+j*j,make_pair(i,j)));
		}
	}
	sort(v.begin(),v.end());
	int h,w;
	while(cin>>h>>w,h){
		int a=h*h+w*w;
		bool flag=0;
		for(auto x:v){
			if(flag){
				cout<<x.second.first<<" "<<x.second.second<<endl;
				break;
			}
			if(x.first==a && x.second.first==h){
				flag=1;
			}
		}
	}
}

C++: #include <iostream>
#include <cstdlib>
#define max_T 50
#define max_P 10

using namespace std;

int cmp(const void *,const void *);

int main(void){
	for(int M,T,P,R;cin >> M >> T >> P >> R,M;){
		int solve[max_T][3]={0};
		for(int i=0;i<T;i++)
			solve[i][0]=i+1;

		int p_min[max_T][max_P]={0};
		for(int m,t,p,j,i=0;i<R&&cin >> m >> t >> p >> j;i++){
			p_min[t-1][p-1]+=j?20:m;
			if(!j){
				solve[t-1][1]++;
				solve[t-1][2]+=p_min[t-1][p-1];
			}
		}

		qsort((void *)solve,T,sizeof(solve[0]),cmp);

		for(int i=0;i<T;i++)
			cout << solve[i][0] << (i<T-1?solve[i][1]!=solve[i+1][1]||solve[i][2]!=solve[i+1][2]?",":"=":"");
		cout << endl;
	}
}

int cmp(const void *a,const void *b){
	int *s[2]={(int *)a,(int *)b},ret;

	if(s[0][1]>s[1][1])
		ret=-1;
	else if(s[0][1]<s[1][1])
		ret=1;
	else
		if(s[0][2]<s[1][2])
			ret=-1;
		else if(s[0][2]>s[1][2])
			ret=1;
		else
			ret=s[0][0]>s[1][0]?-1:1;

	return ret;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main(){

    cin.tie(0);
    ios::sync_with_stdio(false);

    while( true ){

        int m, t, p, r;
        cin >> m >> t >> p >> r;
        if(m == 0 && t == 0 && p == 0 && r == 0)
            break;

        vector<int> correct(t, 0);
        vector<int> time(t, 0);
        vector<vector<int>> incorrect(t, vector<int>(p, 0));

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

            int mi, ti, pi, ji;
            cin >> mi >> ti >> pi >> ji;

            if(ji == 0){
                correct[ti - 1] += 1;
                time[ti - 1] += incorrect[ti - 1][pi - 1] * 20 + mi;
            } else {
                incorrect[ti - 1][pi - 1]++;
            }

        }

        vector<vector<int>> bucket(p + 1, vector<int>(0));

        for(int i = 0; i < t; i++)
            bucket[correct[i]].push_back(i);
/*
        for(auto &x : bucket){
            for(auto &z : x)
                cout << z << ' ';
            cout << endl;
        }
*/
        int count = 0;
        for(int i = bucket.size() - 1; i >= 0; i--) {
            if(bucket[i].size() == 1)
                cout << bucket[i][0] + 1 << ( ++count != t ? "," : "");
            if(bucket[i].size() > 1){
                vector<pair<int, int>> p(bucket[i].size());
                for(int j = 0; j < bucket[i].size(); j++){
                    p[j] = make_pair(time[bucket[i][j]], bucket[i][j]);
                }
                sort(p.begin(), p.end());
                stack<int> st;
                for(int j = 0; j < bucket[i].size(); j++){
                    if(j != bucket[i].size() - 1){
                        if(p[j].first == p[j+1].first) {
                            st.push(p[j].second);
                        } else {
                            if (!st.empty()) {
                                st.push(p[j].second);
                                while(!st.empty()) {
                                    cout << st.top() + 1 << ( ++count != t ? (st.size() != 1 ? "=" : ",") : "");
                                    st.pop();
                                }
                            } else
                                cout << p[j].second + 1 << ( ++count != t ? "," : "");
                        }
                    } else {
                        if (!st.empty()) {
                            st.push(p[j].second);
                            while(!st.empty()) {
                                cout << st.top() + 1 << ( ++count != t ? (st.size() != 1 ? "=" : ",") : "");
                                st.pop();
                            }
                        } else
                            cout << p[j].second + 1 << ( ++count != t ? "," : "");
                    }
                }
            }
        }
        cout << endl;

    }

    return 0;

}