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 <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>

using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using pii = pair<int, int>;
#define out(S) cout<<(S)<<endl;
#define REP(i,b) for(size_t i=0;i<(b);i++)
#define rREP(i,b) for(int i=(b)-1;i>=0;i--)
#define FOR(i,a,b) for(size_t i=(a);i<(b);i++)
#define rFOR(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define Foreach(item,collection) for(auto item:collection)
#define mod(i) ((i) % (ll)(1e9 + 7))
ll modpow(ll i, ll j) { ll tmp = 1; while (j) { if (j % 2)tmp = mod(tmp*i); i = mod(i*i); j /= 2; }return tmp; }
#define divmod(a,b) (mod(a * modpow((ll)b,(ll)(1e9 + 5))))
#define Yes out("Yes")
#define No out("No")
#define NO out("NO")
#define YES out("YES")
#define INF 1e10;
#define ShowAll(collection) for(auto i:collection){out(i);}
#define IfOut(condition,text) if((condition)){out(text);return 0;}
#define IfeOut(condition,itext,etext) if(condition){out(itext);return 0;}else{out(etext);return 0;}
#define Select(collection,condition,result) Foreach(i,collection){result+=condition;}
#define GetAuto(_N,vect) {cin>>_N;vect.resize(_N);REP(i,_N){cin>>vect[i];}}
#define beginend(vec) (vec).begin(),(vec).end()
#define pb(item) push_back(item)
#define removeAll(vec,deleg) auto itr=remove_if(beginend(vec),deleg);vec.erase(itr,vec.end());
#define WhileCin(n) while(cin>>n)
void removeAt(string& s, int index) { s.erase(index, 1); }
template<typename T> void removeAt(vector<T>& v, int index) { v.erase(v.begin() + index); }
ll manhattanDistance(ll x1, ll y1, ll x2, ll y2) { return (abs(x2 - x1) + abs(y2 - y1)); }
vector<ll> sieveOfEratosthenes(int max) { ll prime; double sqrtmax = sqrt(max); vector<ll> primeVec, searchVec; FOR(i, 2, max + 1) searchVec.push_back(i); do { prime = searchVec[0]; primeVec.push_back(prime); auto itr = remove_if(beginend(searchVec), [=](ll x)->bool {return x%prime == 0; }); searchVec.erase(itr, searchVec.end()); } while (prime < sqrtmax); primeVec.reserve(primeVec.size() + searchVec.size()); primeVec.insert(primeVec.end(), beginend(searchVec)); return primeVec; }


struct Team
{
	int tNum;
	int sTime;
	int cCount;
};

int main()
{
	int M, T, P, R;
	bool w_flag = true;
	vector<string> ans;

	WhileCin(M >> T >> P >> R) {
		vector<Team> team;
		vvi teamPenalty;
		teamPenalty.resize(T);
		REP(i, T) { Team t; t.cCount = 0; t.sTime = 0; t.tNum = i+1;team.pb(t);	teamPenalty[i].resize(P,0);	}
		int n = 0;
		do
		{
			int mi, ti, pi, ji;
			cin >> mi >> ti >> pi >> ji;
			if (!mi && !ti && !pi && !ji) { w_flag = false; break; }
			if (ji) { n++; teamPenalty[ti - 1][pi-1] += 20; continue; }
			team[ti - 1].sTime += mi + teamPenalty[ti - 1][pi-1];
			team[ti - 1].cCount++;
			n++;
		} while (n<R);
		sort(beginend(team), [](Team t1, Team t2) {return (t1.cCount == t2.cCount) ? (t1.sTime == t2.sTime) ? (t1.tNum < t2.tNum) : (t1.sTime > t2.sTime) : (t1.cCount < t2.cCount); });
		reverse(beginend(team));
		int bfTime = 0, bfCount = 0;
		bool out_flag = false;
		string q = "";
		Foreach(i, team) {if (out_flag) {if (bfCount == i.cCount&&bfTime == i.sTime) q += "=";else q += ",";}bfCount = i.cCount;bfTime = i.sTime;out_flag = true;q += to_string(i.tNum);}
		ans.pb(q);
		if (!w_flag) break;
	}
	Foreach(i, ans) out(i);
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>

using namespace std;

struct Team
{
	int num;
	vector<int> corrects;
	vector<int> incorrects;
	int time;

	Team(int p) : num(0), corrects(p, 0), incorrects(p, 0), time(0) {}

	bool operator < (const Team& t) const {
		int c = count(corrects.begin(), corrects.end(), 1);
		int tc = count(t.corrects.begin(), t.corrects.end(), 1);

		if (c == tc) {
			if (time == t.time) {
				return num > t.num;
			}
			return time < t.time;
		}

		return c > tc;
	}
};

int main()
{
	while (1)
	{
		int M, T, P, R;
		cin >> M >> T >> P >> R;

		if (M == 0 && T == 0 && P == 0 && R == 0) { break; }

		vector<Team> teams(T, Team(P));

		for (int i = 0; i < T; ++i) {
			teams[i].num = i + 1;
		}

		for (int i = 0; i < R; ++i) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;

			// judge is incorrect.
			if (j != 0) {
				teams[t - 1].incorrects[p - 1]++;
				continue;
			}

			// judge is correct.
			teams[t - 1].corrects[p - 1] = 1;

			int time = m + teams[t - 1].incorrects[p - 1] * 20;
			teams[t - 1].time = time;
		}

		sort(teams.begin(), teams.end());

		int time = 0;
		for (int i = 0; i < teams.size(); ++i) {
			auto&& t = teams[i];

			int c = count(t.corrects.begin(), t.corrects.end(), 1);


			if (i == teams.size() - 1) {
				cout << t.num << endl;
				break;
			}

			auto&& nt = teams[i + 1];

			int nc = count(nt.corrects.begin(), nt.corrects.end(), 1);

			if (c == nc && nt.time == t.time) {
				cout << t.num << '=';
			}
			else {
				cout << t.num << ',';
			}
		}
	}

	return 0;
}