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;

struct Info{
	int id,cost,ac;
};

bool operator < (const Info &a,const Info &b){
	if(a.ac!=b.ac) return a.ac>b.ac;
	if(a.cost!=b.cost) return a.cost<b.cost;
	return a.id>b.id;
}

int main()
{
	int M,T,P,R;
	while(cin>>M>>T>>P>>R){
		if(M==0) break;
		vector<vector<int> >num_WA(T,vector<int>(P,0));
		vector<int> cost(T,0);
		vector<int> num_AC(T,0);
		for(int i=0;i<R;i++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			t--;
			p--;
			if(j==0){
				cost[t] += m+num_WA[t][p]*20;
				num_AC[t]++;
			}
			else{
				num_WA[t][p]++;
			}
		}
		vector<Info> temp;
		for(int i=0;i<T;i++){
			Info hoge;
			hoge.cost=cost[i];
			hoge.id=i+1;
			hoge.ac=num_AC[i];
			temp.push_back(hoge);
		}
		sort(temp.begin(),temp.end());
		int bef_ac=0,bef_cost=0;
		for(int i=0;i<temp.size();i++){
			if(i!=0){
				if(bef_ac==temp[i].ac && bef_cost==temp[i].cost){
					cout<<"=";
				}
				else cout<<",";
			}
			cout<<temp[i].id;
			bef_ac=temp[i].ac;
			bef_cost=temp[i].cost;
		}
		cout<<endl;
	}
	return 0;
}

C++: #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <fstream>
#include <list>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toStr(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX/10;

typedef vector<vvi> vvvi;

struct team {
	int n, q, t;
	team() : q(0), t(0) {};
	bool operator<(const team &o)const {
		return q!=o.q ? q<o.q : (t!=o.t ? o.t<t : n<o.n);
	}
};

int main() {
	int M, T, P, R;
	while(cin >> M >> T >> P >> R, M) {
		vvvi data(T, vvi(2, vi(P, 0)));
		REP(i, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if(j == 0) {
				data[t-1][0][p-1] = 1;
				data[t-1][1][p-1] += m;
			} else {
				data[t-1][1][p-1] += 20;
			}
		}
		vector<team> teams(T);
		REP(i, T) {
			teams[i].n = i+1;
			teams[i].q = teams[i].t = 0;
		}
		REP(i, T) {
			REP(j, P) {
				if(data[i][0][j]) {
					teams[i].q++;
					teams[i].t += data[i][1][j];
				}
			}
		}
		sort(RALL(teams));
		int curq = teams[0].q, curt = teams[0].t;
		cout << teams[0].n;
		FOR(i, 1, T-1) {
			if(curq == teams[i].q && curt == teams[i].t) {
				cout << "=";
			} else {
				cout << ",";
			}
			cout << teams[i].n;
			curq = teams[i].q;
			curt = teams[i].t;
		}
		cout << endl;
	}

	return 0;
}