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<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-9;
const int inf=1e8;
int main(){
	int T,team,pro,n;
	while(cin>>T>>team>>pro>>n,T){
		vvi co(team,vi(pro));
		vip in(team);
		rep(i,team)in[i].second.second=-i-1;
		rep(i,n){
			int a,b,c,d;
			cin>>a>>b>>c>>d;
			if(d){
				co[b-1][c-1]++;
			}else{
				in[b-1].first--;
				in[b-1].second.first+=a+20*co[b-1][c-1];
			}
		}
		sort(all(in));
//		rep(i,team)cout<<in[i].first<<" "<<in[i].second.first<<" "<<in[i].second.second<<endl;
		rep(i,team-1)cout<<-in[i].second.second<<(in[i].first==in[i+1].first&&in[i].second.first==in[i+1].second.first?"=":",");
		cout<<-in[team-1].second.second<<endl;
	}
}

C++: #include <iostream>
using namespace std;
int main(){
  int a,b,c,d,a1,b1,c1,d1,i,j;
  while(cin>>a1>>b1>>c1>>d1,a1){
    int t[55][2]={0},q[51][11]={0};
  while(d1--){
    cin>>a>>b>>c>>d;
    if(d){
      q[b][c]++;
    }
    else{
      if(q[b][c])t[b][1]+=20*q[b][c];
      t[b][1]+=a;
      t[b][0]++;
  }
  }
  int w,pre=-9,pr=-2,max,lp=0;
  for(i=1;i<b1+1;i++){
    max=w=-1;
    for(j=b1;j>0;j--){
      if(max<t[j][0]){max=t[j][0];w=j;}
      else if(max==t[j][0]){
	if(t[j][1]<t[w][1]){max=t[j][0];w=j;}
      }
    }
    if(lp){
      if(pre==t[w][0]&&pr==t[w][1])cout<<'='<<w;
      else cout<<','<<w;
    }
    else cout<<w;
    pre=t[w][0];
    pr=t[w][1];
    t[w][0]=-1;
    lp++;
  }
  cout<<endl;
  }
}

C++: #include <iostream>
#define N 2001
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+1].tnum;
    }
    cout << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

struct STATE
{
	int num;
	int time;
	int id;
	int pe[10];
	
	bool operator < (const STATE& t) const{
		if (num == t.num){
			if (time == t.time){
				return id < t.id;
			}
			return time > t.time;
		}
		return num < t.num;
	}
	
	bool operator == (const STATE& t) const{
		return num == t.num && time == t.time;
	}
};

STATE team[50];

void init()
{
	for (int i = 0; i < 50; i++){
		team[i].num = team[i].time = 0;
		team[i].id = i + 1;
		for (int j = 0; j < 10; j++){
			team[i].pe[j] = 0;
		}
	}
}

int main()
{
	int M, T, P, R;
	while (scanf("%d %d %d %d", &M, &T, &P, &R), M + T + P + R){
		init();
		
		for (int i = 0; i < R; i++){
			int m, t, p, j;
			scanf("%d %d %d %d", &m, &t, &p, &j);
			t--; p--;
			
			if (j == 0){
				team[t].num++;
				team[t].time += m + team[t].pe[p];
			}
			else {
				team[t].pe[p] += 20;
			}
		}
		
		sort(team, team + T);
		reverse(team, team + T);
		
		for (int i = 0; i < T; i++){
			if (i){
				if (team[i] == team[i - 1]){
					cout << "=";
				}
				else {
					cout << ",";
				}
			}
			cout << team[i].id;
		}
		cout << endl;
	}
	
	return 0;
}