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;

int main(){
  int M,T,P,R;
  while(cin >> M >> T >> P >> R){
    if(M==0)break;
    vector<int> times(T,0), solved(T,0);
    vector< vector<int> > WA(T, vector<int>(10,0) );

    for(int i=0;i<R;i++){
      int m,t,p,j;
      cin >> m >> t >> p >> j;
      t--; p--;
      if(j==0){
	solved[t]++;
	times[t] += m + WA[t][p] * 20;
      }else{
	WA[t][p]++;
      }
    }

    vector< vector<int> > rank;
    for(int i=0;i<T;i++){
      vector<int> tmp;
      tmp.push_back(-solved[i]);
      tmp.push_back(times[i]);
      tmp.push_back(-i);
     
      rank.push_back(tmp);
    }

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

    for(int i=0;i<T;i++){
      cout << -rank[i][2]+1;
      if(i+1==T)cout << endl;
      else if(rank[i][0] == rank[i+1][0] && rank[i][1] == rank[i+1][1]){
	cout << "=";
      }else cout << ",";
    }
  }
}

C++: #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;

int M, T, P, R;
const int PENALTY = 20;

struct team {
	int ac, time, id;
	vector<int> wrong;
	team(int id):ac(0), time(0), id(id), wrong(P, 0){}

	bool operator<(const team& t) const {
		if(ac != t.ac)
			return ac < t.ac;

		if(time != t.time)
			return time > t.time;

		return id < t.id;
	}

	bool operator==(const team& t) const {
		return ac == t.ac && time == t.time;
	}

	void accept(int p_id, int t) {
		++ac;
		time += wrong[p_id] * PENALTY + t;
	}

	void wrong_answer(int p_id) {
		++wrong[p_id];
	}
};

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	while(cin >> M >> T >> P >> R, M) {
		vector<team> teams;
		teams.reserve(T);

		for(int i = 1; i <= T; ++i) {
			teams.push_back(team(i));
		}

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

			if(j == 0) {
				teams[t - 1].accept(p - 1, m);
			}
			else {
				teams[t - 1].wrong_answer(p - 1);
			}
		}

		sort(teams.rbegin(), teams.rend());
		for(int i = 0; i < T; ++i) {
			cout << teams[i].id;
			if(i == T - 1) {
				cout << endl;
			}
			else {
				if(teams[i] == teams[i + 1])
					cout << '=';
				else
					cout << ',';
			}
		}
	}

	return EXIT_SUCCESS;
}

C++: #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> v;
vector<vector<int>> miss;
vector<vector<int>> score;
vector<vector<pair<int,int>>> rk;

void solve(int m,int t,int p,int r){
    int in;
    v=vector<vector<int>>(r,vector<int>(4,0));
    miss=vector<vector<int>>(t,vector<int>(p,0));
    score=vector<vector<int>>(t,vector<int>(2,0));
    rk=vector<vector<pair<int,int>>>(p+1,vector<pair<int,int>>(0));
    for(int i=0;i<r;i++){
        for(int j=0;j<4;j++){
            cin>>in;
            v[i][j]=in;
        }
    }
    for(int i=0;i<r;i++){
        if(v[i][3])miss[v[i][1]-1][v[i][2]-1]++;
        else {
            score[v[i][1]-1][0]++;
            score[v[i][1]-1][1]+=v[i][0]+miss[v[i][1]-1][v[i][2]-1]*20;
        }
    }
    for(int i=t-1;i>=0;i--){
        rk[score[i][0]].push_back(make_pair(i,score[i][1]));
    }
    for(int i=p;i>=0;i--){
        int maxx=-1;
        for(int j=0;j<rk[i].size();j++){
            maxx=max(maxx,rk[i][j].second);
        }
        bool sw=false;
        for(int j=0;j<=maxx;j++){
            bool swc=false;
            for(int k=0;k<rk[i].size();k++){
                if(rk[i][k].second==j){
                    if(swc)cout<<"="<<rk[i][k].first+1;
                    else {
                        if(sw)cout<<","<<rk[i][k].first+1;
                        else{
                            cout<<rk[i][k].first+1;
                            sw=true;
                        }
                    }
                    swc=true;
                }
            }
        }
        if(i&&sw)cout<<",";
    }
    cout<<endl;
}


int main(void){
    ios::sync_with_stdio(false);
    int a,b,c,d;
    while(cin>>a>>b>>c>>d,a){
        solve(a,b,c,d);
    }
}