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>
using namespace std;

#define rep(i,n) for(int i=0;i<n;++i)
#define Rep(i,n) for(int i=1;i<=n;++i)
#define rrep(i,n) for(int i=n-1;0<=i;--i)
#define rRep(i,n) for(int i=n;0<i;--i)
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define EPS 1e-8
#define INF 1e8

typedef double Real;
typedef int Int;
typedef vector<Int> vi;
typedef vector<vector<Int> > vvi;
typedef pair<Int,Int> pii;

inline Real sr(Real a) {return sqrt(max(a, (Real)0));}
const vi dy = {-1, 0, 1, 0}, dx = {0, -1, 0, 1};

template <typename K, typename V> ostream& operator<< (ostream& out, const pair<K, V>& p) {
  out << '(' << p.first << ", " << p.second << ')';
  return out;
}

template <typename T> ostream& operator<< (ostream& out, const vector<T>& v) {
  out << '[';
  rep(i, v.size()) out << v[i] << ",";
  out << "\b], " << v.size();
  return out;
}

void solve(){
  Int M, T, P, R, m, t, p, j;
for(;;){
  cin >> M >> T >> P >> R;
  if(M == 0) return;

  vvi penalty(T, vi(P, 0));
  map<Int, pii> scores; // <teamnum, <correctprobrems, time>>
  rep(i, T) scores[i] = make_pair(0, 0);

  rep(i, R){
    cin >> m >> t >> p >> j;
    --t; --p;

    if(j){
      penalty[t][p]++;
      continue;
    }

    pii &ct = scores[t];
    ct.first++;
    ct.second += m + 20 * penalty[t][p];
  }

  vector<pair<Int, pii> > v(all(scores));
  sort(all(v), [&](pair<Int, pii> a, pair<Int, pii> b) {
    if(a.second.first != b.second.first) return a.second.first > b.second.first;
    if(a.second.second != b.second.second) return a.second.second < b.second.second;
    return a.first > b.first;
  });

//  cout << v << endl;

  Int lastnums = v[0].second.first, lasttime = v[0].second.second;
  cout << v[0].first + 1;
  for (int i = 1; i < T; ++i)
  {
    cout << (v[i].second.first == lastnums ? (v[i].second.second == lasttime ? '=' : ',') : ',') << v[i].first + 1;
    lastnums = v[i].second.first;
    lasttime = v[i].second.second;
  }
  cout << endl;
}
}

signed main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(9);

  solve();

  return 0;
}

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

struct STATE
{
	int num;
	int time;
	int id;
	int pe[10];
	
	bool operator < (const STATE& t) const{
		if (num == t.num){
			if (time == t.time){
				return id < t.id;
			}
			return time > t.time;
		}
		return num < t.num;
	}
	
	bool operator == (const STATE& t) const{
		return num == t.num && time == t.time;
	}
};

STATE team[50];

void init()
{
	for (int i = 0; i < 50; i++){
		team[i].num = team[i].time = 0;
		team[i].id = i + 1;
		for (int j = 0; j < 10; j++){
			team[i].pe[j] = 0;
		}
	}
}

int main()
{
	int M, T, P, R;
	while (scanf("%d %d %d %d", &M, &T, &P, &R), M + T + P + R){
		init();
		
		for (int i = 0; i < R; i++){
			int m, t, p, j;
			scanf("%d %d %d %d", &m, &t, &p, &j);
			t--; p--;
			
			if (j == 0){
				team[t].num++;
				team[t].time += m + team[t].pe[p];
			}
			else if (j == 1){
				team[t].pe[p] += 20;
			}
		}
		
		sort(team, team + T);
		reverse(team, team + T);
		
		for (int i = 0; i < T; i++){
			if (i){
				if (team[i] == team[i - 1]){
					cout << "=";
				}
				else {
					cout << ",";
				}
			}
			cout << team[i].id;
		}
		cout << endl;
	}
	
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <climits>
using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RREP(i,n) for(int i=(int)n-1; i>=0; i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)
#define ALL(c) (c).begin(), (c).end()

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > pipii;
typedef vector<int> vi;

class data{
public:
	int team;
	int solve;
	int miss_pro[11];
	ll time;
	
	data(){
		solve = 0;
		REP(i, 11) miss_pro[i] = 0;
		time = 0;
	}
	void c(int t, int pro){
		solve++;
		time += t + miss_pro[pro] * 20;
	}
	
	void w(int pro){
		miss_pro[pro]++;
	}
	
	void print(data d){
		if(solve == d.solve && time == d.time) cout << "=";
		else cout << ",";
		cout << team;
	}
	
	bool operator < (const data& rdata)const{
		if(solve != rdata.solve) return solve > rdata.solve;
		else if(time != rdata.solve) return time < rdata.time;
		else return team > rdata.team;
	}
};


int main(void){
	int M, T, P, R;
	while(cin >> M >> T >> P >> R, M){
		vector<data> teams(T);
		REP(i,teams.size()) teams[i].team = i+1;
		REP(i,R){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			if(!j) teams[t].c(t, p);
			else teams[t].w(p);
		}
		sort(ALL(teams));
		cout << teams[0].team;
		REP(i,teams.size()){
			if(!i) continue;
			teams[i].print(teams[i-1]);
		}
		cout << endl;
	}
	return 0;
}