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;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
#define D10 fixed<<setprecision(10)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
const int MOD = 1000000007;
const int INF = MOD + 1;
const ld EPS = 1e-12;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }

/*--------------------template--------------------*/

int M, T, P, R;

int main()
{
	cin.sync_with_stdio(false);
	while (cin >> M >> T >> P >> R, M)
	{
		vi ac(T); vi team_penalty(T);
		vector<vi> penalty(T, vi(P));
		REP(i, R)
		{
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--; p--;
			if (j == 0)
			{
				ac[t]++;
				penalty[t][p] += m;
				team_penalty[t] += penalty[t][p];
			}
			else
			{
				penalty[t][p] += 20;
			}
		}
		vector<tuple<int, int, int>> order; //ac, penalty, team
		REP(i, T)
		{
			order.emplace_back(-ac[i], team_penalty[i], -i-1);
		}
		sort(ALL(order));
		cout << -get<2>(order[0]);
		FOR(i, 1, T)
		{
			if (get<0>(order[i - 1]) == get<0>(order[i]) && get<1>(order[i - 1]) == get<1>(order[i]))
			{
				cout << '=';
			}
			else cout << ',';
			cout << -get<2>(order[i]);
		}
		cout << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#define MAX_T 50
#define MAX_P 10
using namespace std;

typedef pair<int,int> S;
typedef vector<S> V;
typedef map<int,set<S>> MM;

bool pairCompare(const S& firstElof, const S& secondElof)
{
    return firstElof.second > secondElof.second;
}

int main(void)
{
    int M, T, P, R;
    while (cin >> M >> T >> P >> R) {
        if (M == 0 && T == 0 && P == 0 && R == 0) break;
        int m, t, p, j, data[T + 1][P + 1][2];
        memset(data, 0, sizeof(data));
        for (int i = 0; i < R; i++) {
            cin >> m >> t >> p >> j;
            if (j == 0) {
                data[t][0][0] += (m + data[t][p][1]);
                data[t][0][1]++;
            } else
                data[t][p][1] += 20;
        }
        V v;
        MM mm;
        queue<int> ans;
        for (int i = 1; i <= T; i++) {
            //cout << i << " : " << data[i][0][1] << " : " << data[i][0][0] << endl;
            if (data[i][0][1] == 0) data[i][0][0] = -2;
            mm[data[i][0][1]].insert(S(data[i][0][0],i));
        }
        for (int i = P; i >= 0; i--) {
            stack<int> tmp;
            auto f = mm[i].begin();
            for (auto it = mm[i].begin(); it != mm[i].end(); it++) {
                //cout << " *f.f = " << (*f).first << " *it.f = " << (*it).first << " tmp size = " << tmp.size() << endl;
                if ((*f).first == (*it).first) tmp.push((*it).second); 
                else {
                    if (ans.size()) ans.push(-1);
                    while (tmp.size()) {
                        advance( f, 3);
                        auto ss = tmp.top(); tmp.pop();
                        //cout << "ss " << ss << endl;
                        ans.push(ss);
                        if (tmp.size()) ans.push(-3);
                    }
                    tmp.push((*it).second);
                    //advance( f, 2);
                    //cout << (*f).first << endl;
                }
            }
            if (tmp.size()) {
                if (ans.size())ans.push(-1);
                while (tmp.size()) {
                    auto ss = tmp.top(); tmp.pop();
                    ans.push(ss);
                    if (tmp.size()) ans.push(-3);
                }
            }
        }
        while (ans.size()) {
            int tmp = ans.front(); ans.pop();
            if (tmp == -1) cout << ",";
            else if (tmp == -3) cout << "=";
            else cout << tmp;
        }
        cout << endl;
        
    }
    
    return 0;
}

C++: #include<cstdio>
#include<algorithm>
#include<map>
using namespace std;

typedef pair<int, int> PP;
typedef pair<PP, int> Q;

int main() {
  int M, T, P, R, m[2000], t[2000], p[2000], j[2000];
  while (1) {
    scanf("%d%d%d%d", &M, &T, &P, &R);
    if (M == 0) break;
    int d[500], lasttime[500], ptime[500], wa[500][2000];
    for (int i = 0; i < T; i++) lasttime[i] = ptime[i] = d[i] = 0;
    for (int i = 0; i < T; i++) for (int j = 0; j < R; j++) wa[i][j] = 0;
    for (int i = 0; i < R; i++) {
      scanf("%d%d%d%d", &m[i], &t[i], &p[i], &j[i]);
      t[i]--;
      if (j[i] == 0) {
        lasttime[t[i]] += m[i];
        ptime[t[i]] += wa[t[i]][p[i]];
        d[t[i]]++;
      } else {
        wa[t[i]][p[i]]++;
      }
    }
    Q scores[500];
    for (int i = 0; i < T; i++) scores[i] = Q(PP(d[i], -(lasttime[i] + ptime[i] * 20)), i + 1);
    sort(scores, scores + T, greater<Q>());
    printf("%d", scores[0].second);
    for (int i = 1; i < T; i++) printf("%c%d", scores[i].first.first == scores[i - 1].first.first && scores[i].first.second == scores[i - 1].first.second ? '=' : ',', scores[i].second);
    printf("\n");
  }
}