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++: #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std; 

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;

typedef pair<int, int> Pii;
typedef map<int, int> Mii;
typedef vector<int> Vi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;

struct sol{
	int n, s, ti, wr[20];
	sol(){};
	bool operator<(const sol& rhs) {
		if (s == rhs.s) 
			if (ti == rhs.ti) {
				return n > rhs.n;
			} else 
				return  ti < rhs.ti;
		return s > rhs.s;
	}
};
sol x[55];

int main()
{
	while (1) {
		int M, T, P, R;
		cin >> M >> T >> P >> R;
		if (M==0) break;
		memset(x, 0, sizeof(x));

		rep(i,0,T) x[i].n = i+1;
		rep(i,0,R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			if (j==0) {
				x[t].s++;
				x[t].ti += m + x[t].wr[p];
			}
			else {
				x[t].wr[p] += 20;
			}
		}
		sort(x, x+T+1);
		cout << x[0].n;
		rep(i,1,T) {
			if (x[i].s == x[i-1].s && x[i].ti == x[i-1].ti) cout << "=";
			else cout << ",";
			cout << x[i].n;
		}
		cout << endl;
	}

	return 0;
}

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

  int team;
  int c_num;
  int w_num[11];
  int time;

  bool operator<(const Data& data)const{
    if(data.c_num != c_num)return c_num > data.c_num;
    if(data.time != time)return time < data.time;
    return team > data.team;
  }
  
};
void Init(Data *data,int T,int P){

  for(int i=1 ; i <= T ; i++){
    data[i].team=i;
    data[i].c_num=0;
    data[i].time=0;
    for(int j=1 ; j <= P ; j++){
      data[i].w_num[j]=0;
    }
  }
  
}
bool isSame(Data *data,int a,int b){

  if(data[a].c_num == data[b].c_num && data[a].time == data[b].time)return true;

  return false;
  
}
int main(){
  
  int M,T,P,R;
  
  while(1){

    cin >>M>>T>>P>>R;
    if(M==0 && T==0 && P==0 && R==0)break;

    Data data[T+1];
    Init(data,T,P);
    
    int m,t,p,j;
    for(int i=0 ; i < R ; i++){
      cin >>m>>t>>p>>j;
      if(j == 0){
	data[t].c_num++;
	data[t].time+=m+20*data[t].w_num[p];
      }else{
	data[t].w_num[p]++;
      }
    }

    sort(data+1,data+T+1);

    for(int i=1 ; i <= T ; i++){
      cout <<data[i].team;
      if(i+1 <= T){
	if(isSame(data,i,i+1)){
	  cout <<"="; 
	}else{
	  cout <<",";
	}
      }
    }
    cout <<endl;
    
  }
  
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
void swapp(int*,int*);
int main(){
  while(1){
    int M,T,P,R;
    cin >> M >> T >> P >> R;
    if(M==0&&T==0&&P==0&&R==0)break;
    int te[51];
    int tr[51];
    int tp[51]={};
    int tt[51]={};
    vector<vector<int> >ts(T+1,vector<int>(P,0));
    for(int i=0;i<R;i++){
      int m,t,p,j;
      cin >> m >> t >> p >> j;
      if(j==0){
	tt[t]+=ts[t][p]+m;
	tp[t]++;
      }
      else{
	ts[t][p]+=20;
      }
    }
    for(int i=1;i<=T;i++){
      //
      // cout << i<<" "<<tp[i]<< " "<< tt[i]<<endl;
      //
      tr[i]=i;
      te[i]=0;
    }
    //sort
    for(int i=1;i<=T;i++){
      for(int j=1;j<T;j++){
	if(tp[j]<tp[j+1]){
	  //  cout << tr[j]<<" "<<tr[j+1]<<endl;
	  swapp(tr+j,tr+j+1);
	  swapp(te+j,te+j+1);
	  swapp(tt+j,tt+j+1);
	  swapp(tp+j,tp+j+1);
	  //  cout << tr[j]<<" "<<tr[j+1]<<endl;
	}
	else if(tp[j]==tp[j+1]){
	  if(tt[j]>tt[j+1]){
	    swapp(tr+j,tr+j+1);
	    swapp(te+j,te+j+1);
	    swapp(tt+j,tt+j+1);
	    swapp(tp+j,tp+j+1);
	  }
	  else if(tt[j]==tt[j+1]){
	    if(tr[j]<tr[j+1]){
	      swapp(tr+j,tr+j+1);
	      swapp(te+j,te+j+1);
	      swapp(tt+j,tt+j+1);
	      swapp(tp+j,tp+j+1);
	    }
	    te[j]=1;
	    
	  }
	}
      }
    }
    // for(int i=1;i<=T;i++)  cout << i<<" "<<tp[i]<< " "<< tt[i]<<endl;
    for(int i=1;i<=T;i++){

      cout << tr[i];
      if(i<T){
	if(te[i]==1){
	  cout << '=';
	}
	else cout << ',';
      }
    }
    cout << endl;
  }
  return 0;
}
void swapp(int*m,int*a){
  int b;
  b=*m;
  *m=*a;
  *a=b;
}