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 <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
using pii=pair<int,int>;
using vlai=valarray<int>;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i,s,n) for(int i=s;i<n;i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
 
struct Team{
    int id,ac,pn;
    vi wa=vi(11);
};
 
int main(void){
    int m,t,p,r;
    while(cin>>m>>t>>p>>r,t){
        deque<Team> team(t+1);
        rep(i,t)team[i+1].id=i+1;
        rep(i,r){
            int tm,id,num,res;
            cin>>tm>>id>>num>>res;
            if(res==0){
                team[id].ac++;
                team[id].pn+=team[id].wa[num]*20+tm;
            }else{
                team[id].wa[num]++;
            }
        }
        team.pop_front();
        sort(all(team), [](Team a,Team b){return a.ac>b.ac || (a.ac==b.ac&&(a.pn<b.pn || (a.pn==b.pn&&a.id>b.id))); });
        rep(i,t){
            cout<<team[i].id<<(i+1==t ? "" : (team[i].ac==team[i+1].ac&&team[i].pn==team[i+1].pn?"=":","));
        }
        cout<<endl;
    }
}

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+1,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;
  return;
}

C++: #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

int ac[55] = {0};
int ac2[55][12] = {0};
int wa[55][12] = {0};
int ti[55] = {0};

bool func(int a, int b) {
	a--;
	b--;

	if(ac[a] > ac[b]) return true;
	else if(ac[a] < ac[b]) return false;
	else {
		if(ti[a] < ti[b]) return true;
		else if(ti[a] > ti[b]) return false;
		else {
			if(a > b) return true;
			else return false;
		}
	}
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	while(true) {


		int M,T,P,R;
		cin >> M >> T >> P >> R;
		if(!(M || T || P || R)) break;

		vi rank(T);
		rep(i,0,T) {
			rank[i] = i+1;
			ac[i] = 0;
			ti[i] = 0;
			rep(j,0,P) {
				ac2[i][j] = 0;
				wa[i][j] = 0;
			}
		}

		rep(i,0,R) {
			int m,t,p,j;
			cin >> m >> t >> p >> j;
			if(j == 0) {
				ac[t-1]++;
				ac2[t-1][p-1] = 1;
				ti[t-1] = m;
				rep(j,0,P) if(ac2[t-1][j] == 1) ti[t-1] += wa[t-1][j] * 20;
			}
			else wa[t-1][p-1]++;
		}

		sort(rank.begin(), rank.end(), func);

		rep(i,0,rank.size()-1) {
			cout << rank[i];
			if(ac[rank[i]-1] > ac[rank[i+1]-1]) cout << ',';
			else if(ti[rank[i]-1] < ti[rank[i+1]-1]) cout << ',';
			else cout << '=';
		}
		cout << rank[rank.size()-1] <<endl;

		rep(i,0,rank.size()) {
			cout << ac[i] << " ";
		}
		cout << endl;
		rep(i,0,rank.size()) {
			cout << ti[i] << " ";
		}
		cout << endl;

	}


	return 0;
}