#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()


struct Edge {
    int to, cost, nm;
    Edge(int to, int cost, int nm): to(to), cost(cost), nm(nm) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const int INF = 100000000;

ll GCD(ll a, ll b){
    if(a < b) swap(a, b);
    if(b == 0) return a;
    return GCD(b, a%b);
}

bool cmp(const pii& a, const pii& b){
    if(a.first == b.first){
        return a.second < b.second;
    }
    return a.first < b.first;
}

struct Point{
    int y, x;
};

int N, M;
int arr[100010];

struct S{

    int penalty[15];
    int AC[15];
    S(){
        for(int i=0; i<15; ++i) {
            penalty[i]=0;
            AC[i]=-1;
        }
    }


};

struct SS{
    int num;
    int AC;
    int time;

    bool operator<(const SS& t) const{
        if(AC == t.AC){
            if(time == t.time){
                return num < t.num;
            }else{
                return time > t.time;
            }
        }else{
            return AC < t.AC;
        }
    }
};
int main() {

    //cout << fixed << setprecision(2);

    int M, T, P,R;
    while(cin >> M >> T >> P >> R){
        if(M == 0 && T==0 && P==0&&R==0) break;
        S arr[60];
        for(int i=0; i<T; ++i){
            arr[i] = S();
        }


        for(int i=0; i<R; ++i){
            int m, t, p, j; cin >> m >> t >> p >> j;
            t--; p--;
            if(j==0){
                arr[t].AC[p] = m;
            }else{
                arr[t].penalty[p]++;
            }
        }

        SS arr1[60];
        for(int i=0; i<T; ++i){
            int maxT=0;
            for(int j=0; j<P; ++j){
                if(arr[i].AC[j] != -1){
                    maxT += arr[i].AC[j];
                }
            }

            int cnt=0;
            for(int j=0; j<P; ++j){
                if(arr[i].AC[j]!=-1){
                    cnt++;
                    maxT += arr[i].penalty[j]*20;
                }
            }

            arr1[i].num = i;
            arr1[i].time = maxT;
            arr1[i].AC = cnt;
        }
        sort(arr1, arr1+T);
        reverse(arr1, arr1+T);


        for(int i=0; i<T; ++i){
            if(i==T-1){
                cout << arr1[i].num+1;
            }else{
                cout << arr1[i].num+1;

                if(arr1[i].AC == arr1[i+1].AC && arr1[i].time == arr1[i+1].time){
                    cout << '=';
                }else{
                    cout << ',';
                }
            }
        }
        cout << endl;


    }
    return 0;
}


Measured memory_bytes: 3068