#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

int M,T,P,R;

class Point{
    public:
        int ac,ti;
        int idx;

        bool operator<(const Point& p) const {
            if(ac < p.ac) return true;
            else if(ac == p.ac and ti > p.ti) return true;
            return false;
        }
        bool operator==(const Point& p) const {
            if(ac == p.ac and ti == p.ti) return true;
            else return false;
        }
};


void solve(){
    vector<vector<int>> wa(T,vector<int>(P,0));
    vector<vector<int>> ac(T,vector<int>(P,-1));
    rep(i,R){
        int m,t,p,j;
        cin >> m >> t >> p >> j;
        t--;
        p--;
        if(j==0){
            ac[t][p] = m;
        }else{
            wa[t][p]++;
        }
    }

    vector<Point> point;
    for(int i=0;i<T;i++){
        int po = 0;
        int cnt = 0;
        for(int j=0;j<P;j++){
            if(ac[i][j] == -1) continue;
            cnt++;
            po += ac[i][j];
            po += wa[i][j] * 20;
        }
        Point p;
        p.ac = cnt;
        p.ti = po;
        p.idx = i;
        point.push_back(p);
    }
    sort(all(point));
    reverse(all(point));

    int i=0;
    while(i<T){
        int j=i;
        while(j<T and point[i] == point[j]){
            j++;
        }
        vector<int> v;
        for(int k=i;k<j;k++){
            v.push_back(point[k].idx);
        }
        sort(all(v));
        for(int i=v.size()-1;i>=0;i--){
            cout << v[i]+1;
            if(i) cout << "=";
        }
        if(j==T) cout << endl;
        else cout << ",";
        i = j;
    }
}

int main(){
    while(1){
        cin >> M >> T >> P >> R;
        if(M==0 and T==0 and P==0 and R==0) break;
        solve();
    }
}



Measured memory_bytes: 3124