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
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>

using namespace std;

//conversion
//------------------------------------------
inline long toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-6;
const long INF = 1e10;

int mis[51][11],sum[51],cnt[51];
int main(){
	int M,T,P,R;
	while(cin>>M>>T>>P>>R){
		if(M==0&&T==0&&P==0&&R==0)break;
		CLR(mis);CLR(sum);CLR(cnt);
		REP(i,R){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			if(j==0){
				sum[t]+=20*mis[t][p]+m;
				cnt[t]++;
			}else{
				mis[t][p]++;
			}
		}
		vector<pair<pair<int,int>,int> >res;
		REP(i,T)res.PB(MP(MP(-cnt[i+1],sum[i+1]),-(i+1)));
		SORT(res);
		REP(i,SZ(res)){
			cout<<-res[i].second;
			if(i==SZ(res)-1)cout<<endl;
			else if(res[i].first==res[i+1].first)cout<<"=";
			else cout<<",";
		}
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<map>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#define INF 1e9
#define M_Team 50
#define M_Pro 10

typedef long long int ll;
using namespace std;

int wacount[M_Team+1][M_Pro+1]={};
int timesum[M_Team+1]={},anssum[M_Team+1];

bool checkOver(int a,int b){
	if(anssum[a] <  anssum[b])return true;
	if( (anssum[a] == anssum[b]) && (timesum[a]>timesum[b]) )return true;
	return false;
}

void babu_sort(int anssum[M_Team+1],int timesum[M_Team+1],int grad[M_Team+1],int T){
	for(int i=0;i<T;i++){
		for(int j=0;j<T-1-i;j++){
			if( checkOver(grad[j],grad[j+1]) ){
				swap(grad[j],grad[j+1]);
			}
		}
	}
}



void out(int timesum[M_Team+1],int grad[M_Team+1],int T){
	vector<char> ans;

	ans.push_back(grad[0] + '0');
	for(int i=1;i<T;i++){
		if(anssum[ grad[i] ]==anssum[ grad[i-1] ]  &&  timesum[ grad[i] ] == timesum[ grad[i-1] ] ){
			ans.push_back('=');

			if(grad[i] <10){
				ans.push_back(grad[i]+'0');
			}
			else{
				ans.push_back(grad[i]/10+'0');
				ans.push_back(grad[i]%10+'0');
			}
		}
		else{
			ans.push_back(',');

			if(grad[i] <10){
				ans.push_back(grad[i]+'0');
			}
			else{
				ans.push_back(grad[i]/10+'0');
				ans.push_back(grad[i]%10+'0');
			}
		}
	}
	for(int i=0;i<ans.size();i++){
		cout<<ans[i];
	}
	cout<<endl;
}

void solve(int anssum[M_Team+1],int timesum[M_Team+1],int M,int T,int P,int R){
	int grad[M_Team+1];
	for(int i=T;i>=1;i--){
		grad[T-i]=i;
	}
	babu_sort(anssum,timesum,grad,T);
	out(timesum,grad,T);
}

/*
int wacount[51][11]={};
int timesum[11]={},anssum[11];

*/

int main(){
	while(1){

		for(int i=0;i<M_Team+1;i++){
			for(int j=0;j<M_Pro+1;j++){
				wacount[j][i]=0;
			}
			timesum[i]=0;
			anssum[i]=0;
		}

		int M,T,P,R;
		int m,t,p,J;
		cin>>M>>T>>P>>R;
		if(M==0 && T==0 && P==0 && R==0)break;
		for(int i=0;i<R;i++){
			cin>>m>>t>>p>>J;
			if(J!=0){
				wacount[t][p]++;
			}
			else{
				timesum[t]+=m+wacount[t][p]*20;
				anssum[t]++;
			}
		}
	solve(anssum,timesum,M,T,P,R);
	}
	return 0;
}