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<vector>
#include<algorithm>
#include<string>
using namespace std;
int m,t,p,r;
struct team{
int time[200];
bool ok[200];
int id;
int ac;
};
//team a,team b
int oror(team a,team b){//aのほうが強ければ1,bなら0,同じなら2
if(a.ac>b.ac)return 1;
else if(a.ac<b.ac)return 0;
int at=0,bt=0;
for(int i=0;i<=p;i++){
if(a.ok[i]==true)at+=a.time[i];
if(b.ok[i]==true)bt+=b.time[i];
}
if(at<bt)return 1;
else if(at>bt)return 0;
else return 2;
}
int main(){

	while(true){
	cin>>m>>t>>p>>r;
	if(m+t+p+r==0)break;
	vector<team>ta(0);
	ta.resize(200);

	for(int i=0;i<=t;i++)for(int j=0;j<200;j++)ta[i].time[j]=0,ta[i].ok[j]=0;
	for(int i=0;i<=t;i++)ta[i].id=i,ta[i].ac=0;
	for(int i=0;i<r;i++){
	int a,b,c,d;
	cin>>a>>b>>c>>d;//a:経過時間:bチーム番号c:問題番号j:0奈良正解それ以外不正解
	if(d==0){
	ta[b].time[c]+=a;
	ta[b].ac++;
	ta[b].ok[c]=true;
	}
	else {
	ta[b].time[c]+=20;
	}
	}
	ta.erase(ta.begin());
	for(int i=0;i<t;i++){
	for(int j=0;j<t;j++){
	if(oror(ta[i],ta[j])==1)swap(ta[i],ta[j]);
	if(oror(ta[i],ta[j])==2&&ta[i].id>ta[j].id)swap(ta[i],ta[j]);
	}
	}
	for(int i=0;i<t-1;i++){
	if(oror(ta[i],ta[i+1])!=2)cout<<ta[i].id<<",";
	else cout<<ta[i].id<<"=";
	}
	cout<<ta[t-1].id<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
  int m,t,p,r,a,b,c,d;
  while(cin>>m>>t>>p>>r,t){
    int th[55][2]={},w[55][11]={};
    for(int i=0;i<r;i++){
      cin>>a>>b>>c>>d;
      if(d!=0)w[b][c]++;
      else{
	th[b][0]++;
	th[b][1]+=w[b][c]*20+a;
      }
    }
    priority_queue<pair<int,pair<int,int> > > ans;
    for(int i=1;i<=t;i++){
      ans.push(make_pair(th[i][0],make_pair(-th[i][1],i)));
    }
    while(1){
      cout<<ans.top().second.second;
      if(ans.size()==1)break;
      int f=ans.top().first,sf=ans.top().second.first;
      ans.pop();
      if(ans.top().first==f&&ans.top().second.first==sf)cout<<"=";
      else cout<<",";
    }
    cout<<endl;
  }
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

class Data{
public:
  int correct;
  int submit[10];
  int time;
  int team;
  Data():correct(0),time(0),team(0){
    for(int i=0;i<10;i++)
      submit[i]=0;
  }
};

bool operator>(const Data &d1,const Data &d2){
  if(d1.correct!=d2.correct) return d1.correct>d2.correct;
  else if(d1.time!=d2.time) return d1.time<d2.time;
  else return d1.team>d2.team;
}

bool operator==(const Data &d1,const Data &d2){
  return d1.correct==d2.correct && d1.time==d2.time;
}

int main(){
  int m,t,p,r;
  while(cin>>m>>t>>p>>r,m){
    vector<Data> vec(t);
    for(int i=0;i<t;i++)
      vec[i].team=i+1;
    for(int i=0;i<r;i++){
      int a,b,c,d;
      cin>>a>>b>>c>>d;
      b--;
      c--;
      if(d==0){
	vec[b].time+=vec[b].submit[c]*20+a;
	vec[b].correct++;
      }else{
	vec[b].submit[c]++;
      }
    }
    sort(vec.begin(),vec.end(),greater<Data>());
    for(int i=0;i<t-1;i++){
      cout<<vec[i].team;
      if(vec[i]==vec[i+1]){
	cout<<"=";
      }else{
	cout<<",";
      }
    }
    cout<<vec[t-1].team<<endl;
  }
  return 0;
}