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 <cstring>
using namespace std;

int M, T, P, R;
int wa[52][12];
int ac[52], pe[52], id[52];

int main(){
  while(cin >> M >> T >> P >> R){
    if(M == 0) break;

    memset(ac, 0, sizeof(ac));
    memset(wa, 0, sizeof(wa));
    memset(pe, 0, sizeof(pe));

    while(R--){
      int m, t, p, j;
      cin >> m >> t >> p >> j;

      t--;
      p--;

      if(j == 0){
        ac[t]++;
        pe[t] += m;
        pe[t] += 20 * wa[t][p];
      }
      else{
        wa[t][p]++;
      }
    }

    for(int i = 0; i < T; i++){
      id[i] = i + 1;
    }
    for(int i = 0; i < T; i++){
      for(int j = i + 1; j < T; j++){
        if(ac[i] < ac[j] || ac[i] == ac[j] && pe[i] > pe[j] ||
           ac[i] == ac[j] && pe[i] == pe[j] && id[i] < id[j]){
          swap(ac[i], ac[j]);
          swap(pe[i], pe[j]);
          swap(id[i], id[j]);
        }
      }
    }

    cout << id[0];
    for(int i = 1; i < T; i++){
      if(ac[i - 1] == ac[i] && pe[i - 1] == pe[i]) cout << "=";
      else                                         cout << ",";

      cout << id[i];
    }
    cout<<endl;
  }
}

C++: #define _USE_MATH_DEFINES 
#include <iomanip> 
#include <cmath>  
#include<iostream>
#include <fstream>
#include<vector>
#include<algorithm>
#include<bitset>
#include<map>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define repi(i,a,b) for(ll i = (ll)(a) ; i < (ll)(b) ; i++)
#define repd(i,a,b) for(ll i = (ll)(a) ; i > (ll)(b) ; i--)
#define rd(x) cin >> x
#define wr(x)  cout << x
#define wrln(x) cout << x << endl

int M, T, P, R;

int main() {
	struct team {
		int number, point, time;
		bool operator<(const team& right) const {
			// ポイントは大きい方が↑、同じなら時間小さい方が↑
			return point == right.point ? time > right.time : point < right.point;
		}
	};
	while (1) {
		cin >> M >> T >> P >> R;
		if (M == 0 && T == 0 && P == 0 && R == 0) break;
		vector<team> teams;
		team ttemp;
		repi(i, 0, T) {
			team t;
			t.number = i, t.point = 0, t.time = 0;
			teams.push_back(t);
		}
		int mi, ti, pi, ji;//経過時間、チーム番号、問題番号、ジャッジの種類
		int timetemps[51][11] = {};//[チーム番号][問題番号]
		repi(i, 0, R) {
			cin >> mi >> ti >> pi >> ji;
			if (ji == 0) {
				//正解
				teams[ti - 1].point++;
				teams[ti - 1].time += (timetemps[ti - 1][pi] + mi);
			}
			else {
				//不正解
				timetemps[ti-1][pi] += 20;
			}
		}
		sort(teams.begin(), teams.end());
		reverse(teams.begin(), teams.end());
		repi(i, 0, teams.size()) {
			if (i > 0) {
				if (teams[i].point == teams[i - 1].point && teams[i].time == teams[i - 1].time) {
					wr("=");
				}
				else {
					wr(",");
				}
			}
			wr(teams[i].number + 1);
		}
	}
	return 0;
}

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

#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back

struct Team {
    int num=0, ac=0, pen=0;
    int wa[15] = {0};
};

void solve(int M,int T,int P,int R) {
    vector<Team> teams(T+2);
    rep(i,T) teams[i].num=i+1;
    rep(i,R) {
        int time,tm, prg, msg;
        cin>>time>>tm>>prg>>msg;
        tm--; prg--;
        if(msg != 0) {
            teams[tm].wa[prg]++;
        } else {
            teams[tm].ac++;
            teams[tm].pen += teams[tm].wa[prg] * 20 + time;
        }
    }
    rep(i,T) rep(j,T-1) {
        if(teams[j].ac < teams[j+1].ac) swap(teams[j], teams[j+1]);
        if(teams[j].ac == teams[j+1].ac
                and teams[j].pen > teams[j+1].pen) swap(teams[j], teams[j+1]);
        if(teams[j].ac == teams[j+1].ac
                and teams[j].pen == teams[j+1].pen
                and teams[j].num < teams[j+1].num) swap(teams[j], teams[j+1]);
    }

    rep(i,T) {
        cout << teams[i].num;
        if(i+1 == T)
            puts("");
        else if(teams[i].ac == teams[i+1].ac and teams[i].pen == teams[i+1].pen)
            cout << '=';
        else
            cout << ',';
    }
}

int main() {
    int M,T,P,R;
    while(cin>>M>>T>>P>>R, T) solve(M,T,P,R);
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

class Team
{
public:
	int id, penalty, acs;
	vector<int> buffer;

	Team(int id, int problem_number) : id(id), penalty(0), acs(0), buffer(problem_number) { }

	void submit(int m, int p, int j)
	{
		if(!j) {
			acs++;
			penalty += buffer[p] + m;
		} else {
			buffer[p] += 20;
		}
	}
};

bool operator == (const Team& a, const Team& b)
{
	return a.acs == b.acs && a.penalty == b.penalty;
}

bool operator < (const Team& a, const Team& b)
{
	if(a.acs != b.acs) return a.acs > b.acs;
	if(a.penalty != b.penalty) return a.penalty < b.penalty;
	return a.id > b.id;
}

int main()
{
	for(int M, T, P, R; cin >> M >> T >> P >> R && (M||T||P||R); ) {
		vector<Team> teams;

		for(int i = 0; i < T; i++) {
			teams.push_back(Team(i+1, P));
		}

		for(int i = 0; i < R; i++) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			teams[t-1].submit(m, p-1, j);
		}

		sort(teams.begin(), teams.end());

		for(int i = 0; i < T; i++) {
			cout << teams[i].id << (i+1 == T ? '\n' : (teams[i] == teams[i+1] ? '=' : ','));
		}
	}
}