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 <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
typedef pair<ll, int> pll;

int main()
{
  int M,T,P,R;
  while(cin>>M>>T>>P>>R,M||T||P||R) {
    int A[T+1],times[T+1],pena[T+1],miss[T+1][P+1];
    CLR(A);CLR(times);CLR(pena);CLR(miss);
    FOR(i,0,R) {
      int m,t,p,j; cin >> m >> t >> p >> j;
      if(j==0) {
        A[t]++;
        times[t] = m;
        pena[t] += miss[t][p] * 20;
      } else {
        miss[t][p]++;
      }
    }
    vector<pll> score(T);
    FOR(i,1,T+1) {
      ll s = A[i] * 10000000000 - pena[i] - times[i];
      score[i-1] = pll(s, i);
    }
    sort(score.rbegin(), score.rend());
    int j = 1;
    ll now = score[0].first;
    vector<vector<int> > ans(T+1);
    FOR(i,0,T) {
      if(now > score[i].first) {
        j++;
        now = score[i].first;
      }
      ans[j].push_back(score[i].second);
    }
    FOR(i,1,T+1) {
      if((int)ans[i].size() > 0) {
        if(i!=1) cout << ',';
        vector<int> pr;
        FOR(j,0,(int)ans[i].size()) {
          pr.push_back(ans[i][j]);
        }
        sort(pr.rbegin(), pr.rend());
        FOR(j,0,(int)pr.size()) {
          if(j!=0 && j!=pr.size()) cout<<'=';
          cout << pr[j];
        }
      }
    }
    cout << '\n';
  }
  return 0;
}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <numeric>
#include <functional>
#include <cctype>
#include <list>
#include <limits>
#include <cassert>
//#include <boost/multiprecision/cpp_int.hpp>

const double EPS = (1e-10);


using namespace std;
using Int = long long;
//using namespace boost::multiprecision;

const Int MOD = 1000000007;

long long mod_pow(long long x, long long n) {
    long long res = 1;
    for(int i = 0;i < 60; i++){
        if(n >> i & 1) res = res * x % MOD;
        x = x * x % MOD;
    }
    return res;
}

template<typename T>
T gcd(T a, T b) {
    return b != 0 ? gcd(b, a % b) : a;
}

template<typename T>
T lcm(T a, T b) {
    return a * b / gcd(a, b);
}

void fast_input() {
    cin.tie(0);
    ios::sync_with_stdio(false);
}

vector<vector<int>> solve(int M, int T, int P, int R) {
    vector<vector<int>> ret(T, vector<int>(3));
    vector<int> pena(T);
    vector<vector<int>> table(T, vector<int>(P));

    for (int i = 0; i < T; i++) {
        ret[i][2] = -i;
    }

    for (int i = 0; i < R; i++) {
        int m, t, p, j; cin >> m >> t >> p >> j;
        t--;
        p--;
        if (j == 0) {
            ret[t][0]--;
            ret[t][1] += m;
            pena[t] += table[t][p];
        } else {
            table[t][p] += 20;
        }
    }
    for (int i = 0; i < T; i++) {
        ret[i][1] += pena[i];
    }
    sort(ret.begin(), ret.end());

    return ret;
}

int main(void) {
    int M, T, P, R;
    vector<vector<vector<int>>> outputs;
    while (1) {
        cin >> M >> T >> P >> R;
        if (!M && !T && !P && !R) break;
        outputs.push_back(solve(M, T, P, R));
    }

    for (auto &vv : outputs) {
        for (int i = 0; i < vv.size(); i++) {
            cout << -1*vv[i][2]+1;
            if (i != vv.size()-1) {
                if (vv[i][0] == vv[i+1][0] && vv[i][1] == vv[i+1][1]) {
                    cout << "=";
                } else {
                    cout << ",";
                }
            }
        }
        cout << endl;
    }
}