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 <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Question{
public:
    bool isAC = false;
    int p = 0;
};
class Team{
public:
    int ID;
    int AC = 0;
    int ptime = 0;
    vector<Question> q;

    Team() : ID(-1){}
    Team(int id,int qn)
        : ID(id), q(qn+1)
    {
    }

    void submit(int m,int p,int j){
        if(j == 0){
            q[p].p += m;
            q[p].isAC = true;
            AC++;
            ptime += q[p].p;
        }else{
            q[p].p += 20;
        }
    }
};

bool operator==(const Team& a,const Team& b){
    return a.AC == b.AC && a.ptime == b.ptime;
}
bool operator!=(const Team& a,const Team& b){
    return !(a == b);
}

//M:テァツオツづ、ツコツ?ヲツ卍づゥツ鳴?
//T:テ」ツδ?」ツδシテ」ツδ?ヲツ閉ー
//P:テ・ツ閉湘ゥツ。ツ古ヲツ閉ー
//R:テヲツ渉静・ツ?コテヲツ閉ー
void solve(int M,int T,int P,int R){
    vector<Team> team;
    for(int i=1;i<=T;i++){
        team.push_back(Team(i,P));
    }
    for(int i=0;i<R;i++){
        int m,t,p,j;
        cin >> m >> t >> p >> j;
        team[t-1].submit(m,p,j);
    }
    std::sort(team.begin(),team.end(),
            [](const Team& a,const Team& b)->bool{
                if(a.AC < b.AC)
                    return true;
                if(a.AC > b.AC)
                    return false;
                return a.ptime > b.ptime;
            }
            );
    std::reverse(team.begin(),team.end());
    bool f = false;
    cout << team[0].ID;
    for(int i=1;i<T;i++){
        if(team[i-1] == team[i]){
            cout << "=" << team[i].ID;
        }else{
            cout << "," << team[i].ID;
        }
    }
    //for(auto t : team)
    //{
    //    //cout << t.ID << " :" << t.AC << " ," << t.ptime << endl;
    //}
    cout << endl;
}

int main(){
    while(true){
        int M,T,P,R;
        cin >> M >> T >> P >> R;
        if(!M&&!T&&!P&&!R)
            return 0;
        solve(M,T,P,R);
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false

typedef long long ll;
typedef pair<int, int> ii;


struct NODE{

	int n;
	int solve;
	int score;
	vector<int> cnt;
	NODE(){ n = solve =  score = 0; cnt.clear();}
	NODE(int n, int solve, int score, int p): n(n), solve(solve), score(score){
		cnt.clear();
		cnt.resize(p);
	}
	
	bool operator<(const NODE r){
		if(solve != r.solve) return solve < r.solve;
		if(score != r.score) return score > r.score;
		return n < r.n;
	}
	bool operator==(const NODE r){
		if(solve != r.solve) return false;
		if(score != r.score) return false;
		return true;
	}
	
};


int main() {
	
	int M, T, P, R;
	while(cin >> M >> T >> P >> R, M){
		vector<NODE> v(T);
		rep(i, T){
			v[i] = NODE(i+1, 0, 0, P);
		}
		
		rep(i, R){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			p--;
			if(j == 0){
				v[t].solve++;
				v[t].score += (m + 20 * v[t].cnt[p]);
			}
			else{
				v[t].cnt[p]++;
			}
		}
		
		SORT(v);
		
		cout << v[T-1].n;
		for(int i = T-2; i >= 0; i--){
			cout << (v[i+1] == v[i] ? "=" : ",") << v[i].n;
		}
		cout << endl;
	}
	
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "../dump.hpp"
#else
#define dump(...)
#endif

#define rep(i,n) for(ll i=0,i##_cond=(n);i<i##_cond;++i)
#define FOR(i,a,b) for(ll i=(a),i##_cond=(b);i<i##_cond;++i)
#define ROF(i,a,b) for(ll i=(a)-1,i##_cond=(b);i>=i##_cond;--i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend() //sortで大きい順
#define UNIQUE(v) v.erase(unique(all(v)),v.end())
#define SUM(a) accumulate(all(a),0)
#define sz(x) ((ll)(x).size())
#define pb push_back
#define fst first
#define snd second
#define mp make_pair

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<ll,ll> pii;

const ll inf = 1ll<<62;
const ll mod = 1e9+7;

#define int ll

main()
{
  while(1){
    int M,T,P,R; cin >> M >> T >> P >> R;
    if(M == 0) break;
    vvi problem(T,vi(P)); // どのチームがどの問題に何回不正解か
    vector<pair<pii,int>> team(T); // 正答数、所要時間合計、チーム番号
    rep(i,T) team[i].snd = i + 1; // 本当はi+1
    rep(i,R){
      int m,t,p,j; cin >> m >> t >> p >> j; t--; p--;
      if(j) problem[t][p]++;
      else{
	team[t].fst.fst++;
	team[t].fst.snd -= m + 20 * problem[t][p];
      }
    }
    sort(rall(team));
    cout << team[0].snd;
    rep(i,T-1){
      if(team[i].fst.fst == team[i+1].fst.fst and team[i].fst.snd == team[i+1].fst.snd) cout << "=";
      else cout << ",";
      cout << team[i+1].snd;
    }
    cout << endl;
    //dump(team);
  }	    
}