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 <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>
#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 P pair<int,int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;

struct test{
  int team_name,answers;
};

int main(){
  while(1){
    int m,t,p,r;
    cin>>m>>t>>p>>r;
//    cout<<en
    if(m==t&&t==p&&p==r&&r==0) break;
    test teams[55];
    int mistake[55][11]={0};
    int times[55]={0};
    for(int i=0; i<55; i++){
      teams[i].answers=0;
      times[i]=0;
    }
    vector<P> ve;
    for(int i=0; i<r; i++){
      int time,team,id,judge;
      cin>>time>>team>>id>>judge;
      if(judge) mistake[team][id]++;
      else{
        teams[team].answers++;
        times[team]+=mistake[team][id]*20+time;
      }
    }
    
    for(int i=1; i<=t; i++){
      ve.push_back(mk(teams[i].answers,i));
//      cout<<"   i = "<<i;
//      cout<<"          ans = "<<teams[i].answers<<en
    }
//
//    cout<<en
    
    sort(ve.begin(), ve.end(), greater<P>());
//    for(auto v=0; v<ve.size(); v++){
//      cout<<ve[v].second<<"  time:  "<<times[ve[v].second]<<en
//    }
//    cout<<en
//    cout<<en
    
    for(auto v=1; v<ve.size(); v++){
      P now=ve[v];
      int j=v-1;
      while(j>=0&&ve[j].first==now.first&&times[now.second]<times[ve[j].second]){
        ve[j+1]=ve[j];
        j--;
      }
      ve[j+1]=now;
    }
    
    for(int i=0; i<ve.size(); i++){
      cout<<ve[i].second;
      if(i==ve.size()-1) break;
      if(ve[i].first==ve[i+1].first&&times[ve[i].second]==times[ve[i+1].second]) cout<<'=';
      else cout<<',';
    }
    cout<<en
  }
  RE
}

C++: #include <iostream>
#define N 2002
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 << ',';
    }
    cout << data[t].tnum;
    cout << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<cstring>
using namespace std;
int x[100][3], n, a, b, c, d, e, f, g, h, p;
int main() {
	while (true) {
		memset(x, 0, sizeof(x));
		cin >> n >> a >> b >> c;
		if (n == 0) {
			break;
		}
		for (int i = 0; i < c; i++) {
			cin >> d >> e >> f >> g;
			if (g) {
				x[e][2] += 20;
			}
			else {
				x[e][1] = d + x[e][2];
				x[e][0]++;
			}
		}
		p = 0;
		for (int i = 10; i >= 0; i--) {
			for (int j = 0; j <= 1000; j++) {
				h = 0;
				for (int k = a; k > 0; k--) {
					if (x[k][0]==i && x[k][1]==j) {
						if (h >= 1) {
							cout << '=';
						}
						else if (p >= 1) {
							cout << ',';
						}
						cout << k;
						p++;
						h++;
					}
				}
			}
		}
		cout << endl;
	}
}

C++: #include<iostream>
#include<algorithm>
#include<functional>
#include<vector>
#include<string>
#include<map>
#include<queue>
using namespace std;
#define REP(i, a, n) for(int i=a; i<n; i++)
#define RREP(i, a, n) for(int i=n-1; i>=a; i--)
#define INF 1000000000
#define MP(a, b) make_pair(a, b)
#define F first
#define S second

int main() {
	int M, T, P, R;
	while (cin >> M >> T >> P >> R) {
		vector<pair<int, pair<int, int>>> vp;  // correct, time, team
		int pena[51][11];

		REP(i, 0, T) vp.push_back(MP(0, MP(0, -i - 1)));
		REP(i, 0, 51) REP(j, 0, 11) pena[i][j] = 0;

		REP(i, 0, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			p--;

			if (j == 0) {
				vp[t].F--;
				vp[t].S.F += (pena[t][p] + m);
			}
			else {
				pena[t][p] += 20;
			}
		}

		sort(vp.begin(), vp.end());
		//reverse(vp.begin(), vp.end());

		cout << -vp[0].S.S;
		REP(i, 1, vp.size()) {
			if (vp[i - 1].F < vp[i].F) {
				cout << "," << -vp[i].S.S;
			}
			else if (vp[i - 1].S.F < vp[i].S.F) {
				cout << "," << -vp[i].S.S;
			}
			else {
				cout << "=" << -vp[i].S.S;
			}
		}

		cout << endl;
	}
	return 0;
}