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 <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <algorithm>
#include <utility>
#include <iomanip>

#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

typedef pair<int, int> P;

const int INF = 1e15;
const int MOD = 1e9+7;

bool comp(tuple<int, int, int>& x, tuple<int, int, int>& y){
    int x_i = get<0>(x);
    int y_i = get<0>(y);
    int x_a = get<1>(x);
    int y_a = get<1>(y);
    int x_t = get<2>(x);
    int y_t = get<2>(y);

    if(x_a != y_a){
        return x_a > y_a;
    }

    if(x_t != y_t){
        return x_t < y_t;
    }

    return x_i > y_i;
}

signed main(){
    while(true){
        int M, T, P, R;
        cin >> M >> T >> P >> R;

        if(M == 0 && T == 0 && P == 0 && R == 0){
            break;
        }

        vector<vector<int>> res(T+1, vector<int>(P+1));
        vector<vector<bool>> ac(T+1, vector<bool>(P+1, false));
        vector<int> time(T+1);

        rep(i, R){
            int m, t, p, j;
            cin >> m >> t >> p >> j;

            if(j == 0){
                ac[t][p] = true;
                time[t] = m;
                continue;
            }
            res[t][p]++;
        }

        vector<tuple<int, int, int>> rank;
        for(int i = 1; i <= T; i++){
            int pena = 0;
            int AC = 0;
            for(int j = 1; j <= P; j++){
                if(ac[i][j]){
                    pena += res[i][j];
                    AC++;
                }
            }
            pena *= 20;

            rank.emplace_back(i, AC, time[i] + pena);
        }
        sort(rank.begin(), rank.end(), comp);

        rep(i, T-1){
            int r = get<0>(rank[i]);
            int x_a = get<1>(rank[i]);
            int y_a = get<1>(rank[i+1]);
            int x_t = get<2>(rank[i]);
            int y_t = get<2>(rank[i+1]);

            if(x_a != y_a || x_t != y_t){
                cout << r << ",";
            }else{
                cout << r << "=";
            }
        }
        cout << get<0>(rank[T-1]) << endl;

    }

    return 0;
}

C++: #include <stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,pair<int,int> > L;
int main(void) {
  P team[55][12];
  L mama[55];
  int M, T, Q, R;
  int m, t, p, j;
  while(1){
    memset(team,0,sizeof(team));
    memset(mama,0,sizeof(mama));
    scanf("%d %d %d %d", &M, &T, &Q, &R);
    if(M==0 & T==0) break;
    for ( int i = 0; i < R; i++ ) {
      scanf("%d%d%d%d",&m,&t,&p,&j);
      t--;
      if(j==0) team[t][p]=P(m+team[t][p].first,1);
      else team[t][p]=P(20+team[t][p].first,0);
    }

    for(int i=0;i<T;i++){
      for(int l=1;l<=Q;l++){
        if(team[i][l].second==1){
          mama[i].first--;
          mama[i].second.first+=team[i][l].first;
        }
      }

      mama[i].second.second= -i;
    }

    sort(mama,mama+T);

//    for(int i=0;i<T;i++) cout << "first :" << mama[i].first << "second.first :" << mama[i].second.first << "second.second :" << mama[i].second.second << endl;

    for(int i=0;i<T;i++){
    if(i==T-1) {
      printf("%d\n",-mama[i].second.second+1);
      break;
    }
    if(mama[i].first==mama[i+1].first && mama[i].second.first == mama[i+1].second.first){
      printf("%d=",-mama[i].second.second+1);
    }
    else  printf("%d,",-mama[i].second.second+1);
    }
  }

  return 0;
}

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

#define for_(i,a,b) for(int i=(a);i<(b);++i)

typedef pair< int, int > pii;
typedef pair< pii, int > piii;

int M, T, P, R;

int main() {
	while (cin >> M >> T >> P >> R, M) {
		vector< int > cnt(T, 0);
		vector< vector< int > > pen(T, vector< int >(P, 0));
		
		for_(i,0,R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			--t; --p;
			
			if (m <= M) {
				if (j == 0) {
					pen[t][p] = (-pen[t][p]) + m;
					++cnt[t];
				} else if (pen[t][p] <= 0) {
					pen[t][p] -= 20;
				}
			}
		}
		
		vector< piii > info(T, piii(pii(0, 0),0));
		
		for_(i,0,T) {
			info[i].first.first = cnt[i];
			for_(j,0,P) if (pen[i][j] > 0) info[i].first.second -= pen[i][j];
			info[i].second = i + 1;
		}
		
		sort(info.begin(), info.end(), greater< piii >());
		
		for_(i,0,T) {
			cout << info[i].second;
			
			if (i < T - 1) {
				pii p = info[i].first, pn = info[i+1].first;
				if (p == pn) cout << "=";
				else cout << ",";
			}
		}
		cout << endl;
	}
}