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<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>
#include<set>
#include<array>
#include<cassert>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i);

using namespace std;


struct state{
	int id,cost,ac;
};

bool operator < (const state &a,const state &b){
	if(a.ac!=b.ac) return a.ac>b.ac;
	if(a.cost!=b.cost) return a.cost<b.cost;
	return a.id>b.id;
}

int main()
{
	int M,T,P,R;
	while(cin>>M>>T>>P>>R){
		if(M==0) break;
		vector<vector<int> >num_WA(T,vector<int>(P,0));
		vector<int> cost(T,0);
		vector<int> num_AC(T,0);
		rep(i,R){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			t--;
			p--;
			if(j==0){
				cost[t] += m+num_WA[t][p]*20;
				num_AC[t]++;
			}
			else{
				num_WA[t][p]++;
			}
		}
		vector<state> temp;
		rep(i,T){
			state hoge;
			hoge.cost=cost[i];
			hoge.id=i+1;
			hoge.ac=num_AC[i];
			temp.push_back(hoge);
		}
		sort(temp.begin(),temp.end());
		int bef_ac=0,bef_cost=0;
		rep(i,temp.size()){
			if(i!=0){
				if(bef_ac==temp[i].ac && bef_cost==temp[i].cost){
					cout<<"=";
				}
				else cout<<",";
			}
			cout<<temp[i].id;
			bef_ac=temp[i].ac;
			bef_cost=temp[i].cost;
		}
		cout<<endl;
	}
	return 0;
}

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

using namespace std;

struct Team
{
	int id;
	int crr_num;
	int time_sum;
	int fal[10];

	bool operator < (const Team& oth)const{
		if(crr_num==oth.crr_num) {
			if(time_sum==oth.time_sum) return id>oth.id;
			return time_sum<oth.time_sum;
		}
		return crr_num>oth.crr_num;
	}
};

int main(int argc, char const *argv[])
{
	int m,t,p,r;

	while(1){
		cin>>m>>t>>p>>r;
		if(m+t+p+r==0) break;

		vector<Team> jg(t);

		for(int i1=0;i1<t;i1++){
			jg[i1].id=i1+1;
			jg[i1].crr_num=0;
			jg[i1].time_sum=0;
			for(int i2=0;i2<10;i2++){
				jg[i1].fal[i2]=0;
			}
		}

		int tm,tt,tp,j;
		for(int i1=0;i1<r;i1++){
			cin>>tm>>tt>>tp>>j;

			if(j==0){
				jg[tt-1].crr_num++;
				jg[tt-1].time_sum+=(tm+jg[tt-1].fal[tp-1]*20);
			}
			else jg[tt-1].fal[tp-1]++;
		}

		sort(jg.begin(),jg.end());

		cout<<jg[0].id;
		for(int i1=1;i1<t;i1++){
			if(jg[i1].crr_num==jg[i1-1].crr_num && jg[i1].time_sum==jg[i1-1].time_sum){
				cout<<"="<<jg[i1].id;
			}
			else cout<<","<<jg[i1].id;
		}
		cout<<endl;

	}
	return 0;
}

C++: #include <iostream>
#define N 2002
using namespace std;
struct team{
  int tnum;
  int correct;
  int time;
};
int main(){
  int m,t,p,r,im[N],it[N],ip[N],ij[N],incorrect,i,j;
  struct team data[51];
  while(1){
    cin >> m >> t >> p >> r;
    if(m==0&&t==0&&p==0&&r==0) break;
    for(i=0;i<r;i++) cin >> im[i] >> it[i] >> ip[i] >> ij[i];
    for(i=1;i<=t;i++){
      data[i].tnum=i;
      data[i].correct=0;
      data[i].time=0;
    }
    for(i=0;i<r;i++){
      if(ij[i]==0){
	data[it[i]].correct++;
      	incorrect=0;
	for(j=0;j<i;j++){
	  if(it[i]==it[j]&&ip[i]==ip[j]) incorrect++;
	}
	data[it[i]].time=data[it[i]].time+incorrect*20+im[i];
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].tnum>data[j-1].tnum) swap(data[j],data[j-1]);
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].time<data[j-1].time) swap(data[j],data[j-1]);
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].correct>data[j-1].correct) swap(data[j],data[j-1]);
      }
    }
    for(i=1;i<t;i++){
      cout << data[i].tnum;
      if(data[i].correct==data[i+1].correct&&data[i].time==data[i+1].time)
	cout << '=';
      else cout << ',';
            if(i==t-1) cout << data[i].tnum;
    }
    //    cout << data[t].tnum;
    cout << endl;
  }
  return 0;
}