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 <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

int main() {
	int M,T,P,R;
	while(true){
		cin >> M >> T >> P >> R;
		if(M==0) return 0;
		vector<int> m(R),t(R),p(R),j(R);
		REP(i,R){
			cin >> m[i] >> t[i] >> p[i] >> j[i];
			t[i]--;
			p[i]--;
		}
		vector<vector<int>> pena(T,vector<int>(P));
		vector<vector<int>> score(T,vector<int>(2)); //seikai,jikan

		REP(i,R){
			if(j[i] == 0){
				score[t[i]][0]++;
				score[t[i]][1]+=pena[t[i]][p[i]] + m[i];
			}
			pena[t[i]][p[i]]+=20;
		}

		vector<tuple<int,int,int>> tupleScore(T);
		REP(i,T){
			tupleScore[i] = make_tuple(-score[i][0],score[i][1],-1-i);
		}
		sort(ALL(tupleScore));

		int top;
		tie(ignore,ignore,top) = tupleScore[0];
		cout << -top;
		REP(i,T-1){
			int ans1,tim1,ans2,tim2;
			tie(ans1,tim1,ignore)=tupleScore[i];
			tie(ans2,tim2,top)=tupleScore[i+1];
			if(ans1==ans2 && tim1==tim2){
				cout << "=" << -top;
			}
			else{
				cout << "," << -top;
			}
		}

		cout << endl;	
	}
	return 0;
}

C++: #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();
    }
}