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>
#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;

    printf("\n");
    for(int i=0;i<T;i++){
    if(i==T-1) {
      printf("%d",-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>

#define loop(n, i) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;

using namespace std;
typedef long long ll;


int main()
{
    int M, T, P, R;
    while (cin >> M >> T >> P >> R, M) {
        vector<vector<int>> result(T, vector<int>(3+P,0));
        loop(T,i) result[i][0] = i+1;
        loop(R,i) {
             int m, t, p, j;
             cin >> m >> t >> p >> j;
             if (j) {
                 if (result[t-1][p+2] != -1) result[t-1][p+2]++;
             } else {
                 if (result[t-1][p+2] != -1) {
                     result[t-1][1]++;
                     result[t-1][2] += result[t-1][p+2]*20 + m;
                     result[t-1][p+2] = -1;
                 }
             }
        }
        //cout << "====debug====" << endl;
        //for(auto r:result){
        //    cout << r[0] << ' ' << r[1] << ' ' << r[2] << endl;
        //}
        
        sort(all(result),
                [](vector<int> a, vector<int> b) {
                    if(a[1] != b[1]) return a[1] > b[1];
                    if(a[2] != b[2]) return a[2] < b[2];
                    return a[0] > b[0];
                });
            
        loop(T,i) {
            cout << result[i][0];
            if (i==T-1) {
                cout << endl;
            } else if (result[i][1] == result[i+1][1]
                    && result[i][2] == result[i+1][2])
                cout << '=';
            else cout << ',';
        }
    }
}

C++: #include <iostream>
#include <vector>
#include <map>

using namespace std;

int main()
{
	while(1)
	{
		int m,t,p,r;
		cin >> m >> t >> p >> r;
		if(m==0&&t==0&&p==0&&r==0) break;

		vector < vector<int> > mt(t, vector<int>() );
		vector < vector<int> > pt(t, vector<int>() );
		vector < vector<int> > jt(t, vector<int>() );

		for (int i=0;i<r;i++)
		{
			int M,T,P,J;
			cin >> M >> T >> P >> J;
			mt[T-1].push_back(M);
			pt[T-1].push_back(P);
			jt[T-1].push_back(J);
		}
		
		multimap <int,int> rank;

		for (int i=0;i<t;i++)
		{
			int SC=0,PT=0;
			vector <bool> solved(p);
			for (int j=mt[i].size()-1;j>=0;j--)
			{
				if(!solved[pt[i][j]])
				{
					if(jt[i][j]==0)
					{
						solved[pt[i][j]]=true;
						SC++;
						PT+=mt[i][j];
					}
				}else{
					PT+=20;
				}
			}
			pair <int, int> PAIR;
			PAIR.first = (-(SC*500000)+PT)*10-i;
			PAIR.second = i;
			rank.insert(PAIR);
		}
		
		for (multimap<int, int>::iterator i=rank.begin();i!=(--rank.end());i++)
		{
			cout << i->second + 1 << ((((i->first)+(i->second))==(((++i)->first)+((i)->second)))?"=":",");
			i--;
		}
		cout << (--rank.end())->second + 1 << endl;
	}
	return 0;
}