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 <stdio.h>

typedef struct{
  int team;
  int ans[10];
  int time[10];
  int anum;
  int tnum;
}data_t;

void InsSort(data_t data[], int n){
  data_t temp;
  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j].team>data[j-1].team ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j-1] = temp;
    }
  }

  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j].tnum<data[j-1].tnum ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j-1] = temp;
    }
  }
  
  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j].anum>data[j-1].anum ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j-1] = temp;
    }
  }
}

int main(void){
  int M, T, P, R;
  int m, t, p, j;
  data_t data[50];
  while(1){
    scanf("%d%d%d%d", &M, &T, &P, &R);
    if(M==0 && T==0 && P==0 && R==0){
      break;
    }

    for(int i=0; i<T; i++){
      data[i].team = i+1;
      data[i].anum = 0;
      data[i].tnum = 0;
      for(int j=0; j<10; j++){
	data[i].ans[j] = 1;
	data[i].time[j] = 0;
      }
    }

    for(int i=0; i<R; i++){
      scanf("%d%d%d%d", &m, &t, &p, &j);
      if(j == 0){
	data[t-1].ans[p-1] = 0;
	data[t-1].time[p-1] += m;
      }else if(j == 1){
	data[t-1].time[p-1] += 20;
      }
    }
    for(int i=0; i<T; i++){
      for(int j=0; j<P; j++){
	if(data[i].ans[j] == 0){
	  data[i].anum++;
	  data[i].tnum += data[i].time[j];
	}
      }
    }
    InsSort(data, T);

    printf("%d", data[0].team);
    for(int i=1; i<T; i++){
      if(data[i].anum==data[i-1].anum && data[i].tnum==data[i-1].tnum){
	printf("=");
      }else{
	printf(",");
      }
      printf("%d", data[i].team);
    }
    printf("\n");
  }
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitset>
#define INF 2000000000
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
#define ll long long
#define PL pair<long long, long long>
#define PR pair<int,int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;
#define int ll

//ICPC Ranking  AOJ

#define MAX 60
int tt[55];
int pena[55][15];
int point[55];
bool done[MAX];

signed main(){
  int M,T,P,R;
  while(cin>>M>>T>>P>>R&&!(M==0&&T==0&&P==0&&R==0)){
    for(int i=0; i<=55; i++){
      for(int j=0; j<=15; j++){
        pena[i][j]=0;
      }
      tt[i]=0;
      point[i]=0;
      done[i]=false;
    }
    
    for(int i=0; i<R; i++){
      int m,t,p,j;
      cin>>m>>t>>p>>j;
      if(j){
        pena[t][p]++;
      }else{
        tt[t]+=m;
        tt[t]+=pena[t][p]*20;
        point[t]++;
      }
    }
    
    PR pre;
    for(int i=1; i<=T; i++){
      int m=0,t=0;
      int nowt=0;
      for(int j=1; j<=T; j++){
        if(done[j]) continue;
        if(point[j]>m){
          nowt=j;
          m=point[j];
          t=tt[j];
        }else if(point[j]==m){
          if(tt[j]<=t){
            nowt=j;
            m=point[j];
            t=tt[j];
          }
        }
      }
      
      done[nowt]=true;
      if(i==1) cout<<nowt;
      else{
        if(pre.first==m&&pre.second==t){
          cout<<'='<<nowt;
        }else{
          cout<<','<<nowt;
        }
      }
      
      pre.first=m; pre.second=t;
    }
    cout<<en
  }
  RE
}

C++: #include "iostream"
#include "cstring"
#include "vector"
#include "algorithm"
using namespace std;
typedef struct res
{
	int solve;
	int time;
	int id;

	static bool comp(const res& l, const res& r)
	{
		if(l.solve!=r.solve) return l.solve>r.solve;
		if(l.time!=r.time) return l.time<r.time;
		return l.id>r.id;
	}
}res;


int main(void)
{
	int M,T,P,R;
	while (cin>>M>>T>>P>>R,M) {
		int penalty[M][P];
		memset(penalty,0,sizeof(penalty));
		res result[T];
		for (int i = 0; i < T; i++) {
			result[i].solve=0;
			result[i].time=0;
			result[i].id=i+1;
		}
		for (int i = 0; i < R; i++) {
			int m,t,p,r;
			cin>>m>>t>>p>>r;
			if(!r)
			{
				result[t-1].solve+=1;
				result[t-1].time+=m+20*penalty[t-1][p-1];
			}
			else penalty[t-1][p-1]++;
		}
		sort(result,result+T,res::comp);
		for (int i = 0; i < T; i++) {
			if(i!=0)
			{
				if(result[i-1].solve==result[i].solve&&result[i-1].time==result[i].time)
				{
					cout<<"=";
				}
				else cout<<",";
			}
			cout<<result[i].id;
		}

		cout<<endl;
	}
	return 0;
}