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 <vector>
#include <algorithm>

using namespace std;

class Question{
public:
    bool isAC;
    int p;
    Question() : isAC(false),p(0){}
};
class Team{
public:
    int ID;
    int AC;
    int ptime;
    vector<Question> q;

    Team() : ID(-1), q(vector<Question>(21)), ptime(0), AC(0) {}
    Team(int id)
        : ID(id), q(vector<Question>(21)) , ptime(0), AC(0)
    {
    }

    void submit(int m,int p,int j){
        if(j == 0){
            q[p].p += m;
            q[p].isAC = true;
            AC++;
            ptime += q[p].p;
        }else{
            q[p].p += 20;
        }
    }
};

bool operator==(const Team& a,const Team& b){
    return a.AC == b.AC && a.ptime == b.ptime;
}
bool operator!=(const Team& a,const Team& b){
    return !(a == b);
}

//M:テァツオツづ、ツコツ?ヲツ卍づゥツ鳴?
//T:テ」ツδ?」ツδシテ」ツδ?ヲツ閉ー
//P:テ・ツ閉湘ゥツ。ツ古ヲツ閉ー
//R:テヲツ渉静・ツ?コテヲツ閉ー
void solve(int M,int T,int P,int R){
    vector<Team> team;
    for(int i=1;i<=T;i++){
        team.push_back(Team(i));
    }
    for(int i=0;i<R;i++){
        int m,t,p,j;
        cin >> m >> t >> p >> j;
        team[t-1].submit(m,p,j);
    }
    std::sort(team.begin(),team.end(),
            [](const Team& a,const Team& b)->bool{
                if(a.AC < b.AC)
                    return true;
                if(a.AC > b.AC)
                    return false;
                if(a.ptime > b.ptime)
                    return true;
                return a.ID < b.ID;
            }
            );
    std::reverse(team.begin(),team.end());
    //for(auto t : team)
    //{
    //    cout << t.ID << " :" << t.AC << " ," << t.ptime << endl;
    //}
    cout << team[0].ID;
    for(int i=1;i<T;i++){
        if(team[i-1] == team[i]){
            cout << "=" << team[i].ID;
        }else{
            cout << "," << team[i].ID;
        }
    }
    cout << endl;
}

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

C++: #include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>

using namespace std;
using ll = long long;

#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int M, T, P, R;
int m[2003], t[2003], p[2003], j[2003];
int correct[51], penalty[51][11], times[51][11];
void solve() {
    memset(correct, 0, sizeof(correct));
    memset(penalty, 0, sizeof(penalty));
    memset(times, 0, sizeof(times));
    rep(i, R) {
        if (j[i] == 0) {
            correct[t[i]]++;
            times[t[i]][p[i]] += m[i];
            times[t[i]][p[i]] += penalty[t[i]][p[i]] * 20;
        } else {
            penalty[t[i]][p[i]]++;
        }
    }
    vector<tuple<int, int, int>> vec;
    rep(i, T) {
        int sum = 0;
        rep(k, P + 1) sum += times[i][k];
        vec.emplace_back(-correct[i], sum, -i);
    }
    sort(all(vec));
    tuple<int, int, int> pre{-1, -1, -1};
    rep(i, vec.size()) {
        auto x = vec[i];
        if (get<0>(x) == get<0>(pre) and get<1>(x) == get<1>(pre)) {
            cout << "=";
        } else {
            if (i) cout << ",";
        }
        cout << -get<2>(x) + 1;

        pre = x;
    }
    cout << endl;
}
int main() {
    while (cin >> M >> T >> P >> R, M) {
        rep(i, R) cin >> m[i] >> t[i] >> p[i] >> j[i];
        rep(i, R) t[i]--;
        solve();
    }
    return 0;
}