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 <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

class Data
{
public:
    int id;
    int solve;
    int penalty;
    vector<int> wrong;
    Data(int id, int problemNum){
        this->id = id;
        solve = 0;
        penalty = 0;
        wrong.assign(problemNum, 0);
    }
    bool operator<(const Data& d) const{
        return make_pair(-solve, make_pair(penalty, -id)) < make_pair(-d.solve, make_pair(d.penalty, -d.id));
    }
};

int main()
{
    for(;;){
        int endTime, n, problemNum, query;
        cin >> endTime >> n >> problemNum >> query;
        if(endTime == 0)
            return 0;

        vector<Data> d;
        for(int i=0; i<n; ++i)
            d.push_back(Data(i+1, problemNum));

        while(--query >= 0){
            int time, team, problem, judge;
            cin >> time >> team >> problem >> judge;
            -- team;
            -- problem;

            if(judge == 0){
                ++ d[team].solve;
                d[team].penalty += time + d[team].wrong[problem] * 20;
            }
            else{
                ++ d[team].wrong[problem];
            }
        }

        sort(d.begin(), d.end());
        cout << d[0].id;
        for(int i=1; i<n; ++i){
            if(d[i].solve == d[i-1].solve && d[i].penalty == d[i-1].penalty)
                cout << '=';
            else
                cout << ',';
            cout << d[i].id;
        }
        cout << endl;
    }
}

C++: #include<iostream>
#include<map>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
#include<unordered_map>
using namespace std;

struct team {
	int seikai = 0, matigai[10]{}, time = 0, ID;
};
bool operator <(team a, team b) {
	if (a.seikai != b.seikai)return a.seikai > b.seikai;
	else if (a.time != b.time)return a.time < b.time;
	return a.ID > b.ID;
}
int main() {
	int a, b, c, d;
	while (cin >> a >> b >> c >> d, a || b || c || d) {
		team f[51]{};
		f[0].time = f[0].seikai= 1 << 29;
		for (int i = 0; i < b; i++) {
			f[i+1].ID = i + 1;
		}
		for (int e = 0; e < d; e++) {
			int g, h, i, j; scanf("%d%d%d%d", &g, &h, &i, &j); i--;
			if (j) {
				f[h].matigai[i]++;
			}
			else {
				f[h].seikai++;
				f[h].time += f[h].matigai[i] * 20 + g;
			}
		}
		sort(f+1, f + b+1);
		for (int i = 1; i < b; i++) {
			cout << f[i].ID;
			if (f[i].seikai == f[i + 1].seikai&&f[i].time == f[i + 1].time)cout << '=';
			else cout << ',';
		}
		cout <<f[b].ID<< endl;
	}
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = (1LL << 31) - 1;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
#define MAX_N 100100 * 3

int M, T, PP, R;
bool table[50][10];
int sum[50][10];

bool is(const pair<P, int> p1, const pair<P, int> p2) {
	if (p1.first.first == p2.first.first) {
		if (p1.first.second == p2.first.second) {
			return p1.second > p2.second;
		}
		return p1.first.second < p2.first.second;
	}
	return p1.first.first > p2.first.first;
}

int main() {
	while (cin >> M >> T >> PP >> R&&M + T + PP + R) {
		rep(i, 50)rep(j, 10) {
			table[i][j] = 0;
			sum[i][j] = 0;
		}
		vector<pair<P, int>> vpi;
		rep(i, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--; p--;
			if (j == 0) {
				table[t][p] = 1;
				sum[t][p] += m;
			}
			else sum[t][p] += 20;
		}
		rep(i, T) {
			int a = 0, t = 0;
			rep(j, PP) {
				if (table[i][j]) {
					a++;
					t += sum[i][j];
				}
			}
			vpi.push_back({ {a,t},i + 1 });
		}
		sort(ALL(vpi), is);
		/*rep(i, T) {
			cout << "!!" << vpi[i].first.first << " " << vpi[i].first.second << " " << vpi[i].second << endl;
		}*/
		cout << vpi[0].second;
		rep(i, T - 1) {
			if (vpi[i + 1].first.first == vpi[i].first.first&&
				vpi[i + 1].first.second == vpi[i].first.second) {
				cout << "=" << vpi[i + 1].second;
			}
			else {
				cout << "," << vpi[i + 1].second;
			}
		}
		cout << endl;
	}
}