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 <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

struct icpclog{
    int number, time, id;
    int submit_status[10 + 1];

    int compare(const icpclog& o) const {
        if(number != o.number) return o.number - number;
        return time - o.time;
    }

    bool operator <(const icpclog& o) const {
        int res = compare(o);
        if(res != 0) return res < 0;
        return o.id - id < 0;
    }
};

int main() {
    int contest_time, team_n, question_n, submit_n;
    while(cin >> contest_time >> team_n >> question_n >> submit_n, contest_time|team_n|question_n|submit_n){
        vector<icpclog> logs(team_n + 1);
        REP(i, logs.size()) logs[i].id = i;
        REP(i, submit_n){
            int time, team, question, judge;
            cin >> time >> team >> question >> judge;
            if(judge != 0)
                logs[team].submit_status[question]++;
            else{
                logs[team].time += time;
                logs[team].time += logs[team].submit_status[question] * 20;
                logs[team].number++;
            }
        }

        logs.erase(logs.begin());
        SORT(logs);

        cout << logs[0].id;
        FOR(i, 1, logs.size()){
            cout << (logs[i-1].compare(logs[i]) == 0 ? "=" : ",") << logs[i].id;
        }
        cout << endl;
    }
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <climits>
using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RREP(i,n) for(int i=(int)n-1; i>=0; i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)
#define ALL(c) (c).begin(), (c).end()

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > pipii;
typedef vector<int> vi;

class data{
public:
	int team;
	int solve;
	int miss_pro[11];
	int time;
	
	data(){
		solve = 0;
		REP(i, 11) miss_pro[i] = 0;
		time = 0;
	}

	void c(int t, int pro){
		solve++;
		time += t + miss_pro[pro] * 20;
	}
	
	void w(int p){
		miss_pro[p]++;
	}
	
	void print(data d){
		if(solve == d.solve && time == d.time) cout << "=";
		else cout << ",";
		cout << team;
	}
	
	bool operator < (const data& rdata)const{
		if(solve != rdata.solve) return solve > rdata.solve;
		else if(time != rdata.time) return time < rdata.time;
		else return team > rdata.team;
	}
};


int main(void){
	int M, T, P, R;
	while(cin >> M >> T >> P >> R, M){
		vector<data> teams(T);
		REP(i,teams.size()) teams[i].team = i+1;
		REP(i,R){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			if(!j) teams[t].c(m, p);
			else teams[t].w(p);
		}
		sort(ALL(teams));
		cout << teams[0].team;
		REP(i,teams.size()){
			if(!i) continue;
			teams[i].print(teams[i-1]);
		}
		cout << endl;
	}
	return 0;
}