#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
#define REP(i,a,b) for(i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define ALL(a) (a).begin(),(a).end()
#define ifnot(a) if(not a)
#define dump(x)  cerr << #x << " = " << (x) << endl
using namespace std;

void reader(int &a) { scanf("%d", &a); }
void reader(double &a) { scanf("%lf", &a); }
void reader(char a[]) { scanf("%s", a); }
void reader(char &a) { scanf(" %c", &a); }
void reader(ll &a) { scanf("%lld", &a); }
void reader(ull &a) { scanf("%llu", &a); }
// void reader(string& a){cin >> a;};
template<class T, class U> void reader(T& t, U& u) { reader(t); reader(u); }
template<class T, class U, class V> void reader(T& t, U& u, V& v) { reader(t); reader(u); reader(v); }

void writer(const int a, char c) { printf("%d", a); putchar(c); }
void writer(const ll a, char c) { printf("%lld", a); putchar(c); }
void writer(const ull a, char c) { printf("%llu", a); putchar(c); }
void writer(const double a, char c) { printf("%.20lf", a); putchar(c); }
void writer(const char a[]) { printf("%s", a); };
void writer(const char a[], char c) { printf("%s", a); putchar(c); };
void writer(const char a, char c) { putchar(a); putchar(c); };
template<class T> void writerLn(T t) { writer(t, '\n'); }
template<class T, class U> void writerLn(T t, U u) { writer(t, ' '); writer(u, '\n'); }
template<class T, class U, class V> void writerLn(T t, U u, V v) { writer(t, ' '); writer(u, ' '); writer(v, '\n'); }
template<class T> void writerArr(T x[], int n) { int i; if (!n) { putchar('\n'); return; }rep(i, n - 1) writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerVec(vector<T> x) { int n = x.size(); int i; if (!n) { putchar('\n'); return; }rep(i, n - 1) writer(x[i], ' '); writer(x[n - 1], '\n'); }

vector<string> split(const string &str, char sep) { vector<string> v; stringstream ss(str); string buffer; while (getline(ss, buffer, sep)) { v.push_back(buffer); }return v; }
// #define int ll
bool test = 1;
int dx[] = { 0,1,0,-1 };
int dy[] = { 1,0,-1,0 };
#define MAX 300000
//.....................
ull mod = (int)1e9 + 7;

struct Rank {
	int num;
	int AC_cnt;
	int t;
	bool operator < (const Rank& r) const {
		if (AC_cnt < r.AC_cnt) return true;
		if (AC_cnt == r.AC_cnt) {
			if (t > r.t) return true;
			if (t == r.t) {
				if (num < r.num) return true;
			}
		}
		return false;
	}
};

signed main(void)
{
	int i, j, k;
	while (1) {
		int M, T, P, R;
		bool AC[51][11] = {};
		int AC_cnt[51] = {};
		int elapsed_time[51] = {};
		int WA[51][11] = {};
		reader(M, T, P);
		reader(R);
		if (M == 0) return 0;
		rep(i, R) {
			int m, t, p, j;
			reader(m, t);
			reader(p, j);
			t--; p--;
			if (j == 0) {
				if (!AC[t][p]) {
					AC[t][p] = true;
					AC_cnt[t] += 1;
					elapsed_time[t] += m + WA[t][p] * 20;
				}
			}
			else {
				WA[t][p] += 1;
			}
		}
		Rank team[50];
		rep(i, T) {
			team[i].num = i;
			team[i].AC_cnt = AC_cnt[i];
			team[i].t = elapsed_time[i];
		}
		sort(&team[0], &team[T]);
		printf("%d",team[T-1].num+1);
		for (i = T - 2; i > -1; i--) {
			if (team[i].AC_cnt != team[i + 1].AC_cnt
				|| team[i].t != team[i + 1].t) {
				printf(",");
			}
			else printf("=");
			printf("%d", team[i].num+1);
		}
		puts("");
	}
	return 0;
}

Measured memory_bytes: 1232