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
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <cctype>

using namespace std;

#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n)  FOR(i,0,n)

struct Team {

    Team() {

    }

    Team(int team_id, int P) {
        this->team_id = team_id;
        solve_count = 0;
        last_time = 0;
        problems.resize(P, false);
        error_counts.resize(P, 0);
        times.resize(P, 0);
    }

    vector<bool> problems;
    vector<int> error_counts;
    vector<int> times;
    int team_id;
    int solve_count;
    int last_time;

};

bool comp(const Team &t1, const Team &t2) {

    int t1_solve_count = 0;
    for (int i = 0; i < t1.problems.size(); i++) {
        if (t1.problems[i]) t1_solve_count++;
    }

    int t2_solve_count = 0;
    for (int i = 0; i < t2.problems.size(); i++) {
        if (t2.problems[i]) t2_solve_count++;
    }

    int t1_time = 0;
    for (int i = 0; i < t1.error_counts.size(); i++) {
        if (t1.problems[i]) {
            t1_time += (t1.times[i] + 20 * t1.error_counts[i]);
        }
    }

    int t2_time = 0;
    for (int i = 0; i < t2.error_counts.size(); i++) {
        if (t2.problems[i]) {
            t2_time += (t2.times[i] + 20 * t2.error_counts[i]);
        }
    }

    //team1の方が弱かったらtrue
    if (t1_solve_count < t2_solve_count) {
        return false;
    } else if (t1_solve_count > t2_solve_count) {
        return true;
    } else {

        if (t1_time < t2_time) {
            return true;
        } else if (t1_time > t2_time) {
            return false;
        } else {

            if (t1.team_id > t2.team_id) {
                return true;
            } else {
                return false;
            }

        }

    }

}

bool same(const Team &t1, const Team &t2) {
    int t1_solve_count = 0;
    for (int i = 0; i < t1.problems.size(); i++) {
        if (t1.problems[i]) t1_solve_count++;
    }

    int t2_solve_count = 0;
    for (int i = 0; i < t2.problems.size(); i++) {
        if (t2.problems[i]) t2_solve_count++;
    }

    int t1_time = 0;
    for (int i = 0; i < t1.error_counts.size(); i++) {
        if (t1.problems[i]) {
            t1_time += (t1.times[i] + 20 * t1.error_counts[i]);
        }
    }

    int t2_time = 0;
    for (int i = 0; i < t2.error_counts.size(); i++) {
        if (t2.problems[i]) {
            t2_time += (t2.times[i] + 20 * t2.error_counts[i]);
        }
    }

    //team1の方が弱かったらtrue
    if (t1_solve_count < t2_solve_count) {
        return false;
    } else if (t1_solve_count > t2_solve_count) {
        return false;
    } else {

        if (t1_time < t2_time) {
            return false;
        } else if (t1_time > t2_time) {
            return false;
        } else {

            return true;

        }

    }
}

int main() {

    while (true) {

        int M, T, P, R;
        cin >> M >> T >> P >> R;

        if (M == 0 && T == 0 && P == 0 && R == 0) {
            break;
        }

        vector<Team> teams(T);
        REP(i, T) {
            teams[i] = Team(i + 1, P);
        }

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

            if (j == 0) {
                teams[t].times[p] = m;
                teams[t].problems[p] = true;
            } else {
                teams[t].error_counts[p]++;
            }
        }

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

        REP(i, teams.size()) {
            if (i != teams.size() - 1) {
                cout << teams[i].team_id;
                if (same(teams[i], teams[i + 1])) {
                    cout << "=";
                } else {
                    cout << ",";
                }
            } else {
                cout << teams[i].team_id << "\n";
            }
        }

    }

    return 0;
}