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

using namespace std;

typedef tuple<int, int, int, int> RECORD;

class Team
{
public:
	int _id;
	int _time;
	int _solveNum;
	vector<int> _probs;

	void init(int i, int M, int P, int R)
	{
		_id = i;
		_time = 0;
		_solveNum = 0;
		_probs.resize(P, 0);
	}

	void in(int time, int probNum, int b)
	{
		if (!b){
			_time += _probs[probNum] * 20 + time;
			_solveNum++;
		}
		else{
			++_probs[probNum];
		}
	}

	void dump() const
	{
		cout << "id=" << _id;
		cout << "time=" << _time;
		cout << "solvenum=" << _solveNum;
	}

	bool operator==(const Team& r)
	{
		if ( this->_solveNum == r._solveNum && this->_time == r._time ){
//			this->dump();
//			r.dump();
			return true;
		}
		return false;
	}
};

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

		cin >> M >> T >> P >> R;
		if ( M+T+P+R == 0)
			break;
//		if ( R <= 0)
//			continue;

		vector<Team> teams(T);
		for(int i=0; i<T; ++i){
			teams[i].init(i+1, M, P, R);
		}

		for(int i=0; i<R; ++i){
			int time, teamNum, probNum, ret;
			cin >> time >> teamNum >> probNum >> ret;
			teams[teamNum-1].in(time, probNum, ret);
		}

		stable_sort(teams.begin(), teams.end(), [](Team t1, Team t2) -> bool{
			int a = t1._solveNum - t2._solveNum;

			if (a > 0)
				return true;
			if (a < 0)
				return false;
			
			if ( t1._time < t2._time)
				return true;

			if (t1._id > t2._id)
				return true;

			return false;
		});

		auto it = teams.begin();
		cout << (*it)._id;
		for(it += 1; it != teams.end(); ++it)
		{
			if ( *(it-1) == *(it) )
				cout << "=";
			else
				cout << ",";
			cout << (*it)._id;
		}
		cout << endl;
	}
}

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

int main()
{
	int M, T, P, R, m, t, p, j;
	while (cin >> M >> T >> P >> R, M || T || P || R) {
		vector< vector< pair<int, int> > > data(T + 1, vector< pair<int, int> >(P, pair<int, int>(0,0)));
		vector< tuple<int, int, int> > score(T + 1);
		for (int i = 0; i < R; i++) {
			cin >> m >> t >> p >> j;
			if (j == 0) {
				data[t][p].first = m + data[t][p].second * 20;
			}
			else {
				data[t][p].second++;
			}
		}
		for (int i = 1; i <= T; i++) {
			int sco = 0,pena = 0;
			for (int j = 0; j < P; j++) {
				if (data[i][j].first) {
					sco--;
					pena += data[i][j].first;
				}
			}
			score[i] = tuple<int, int, int>(sco,pena,-i);
		}
		sort(score.begin()+ 1, score.end());
		tuple<int, int, int> temp = score[1];
		cout << -get<2>(score[1]);
		for (int i = 2; i <= T; i++) {
			if (get<0>(temp) == get<0>(score[i]) && get<1>(temp) == get<1>(score[i])) {
				cout << "=";
			}
			else {
				cout << ",";
			}
			cout << -get<2>(score[i]);
			temp = score[i];
		}
		cout << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<vector> 
#include<algorithm>
using namespace std;
 
class Present{
public:
  int m;
  int t;
  int p;
  int j;
  Present():m(0),t(0),p(0),j(0){}
};
class Team{
public:
  int num;
  int solve;
  int time;
  Team():num(0),solve(0),time(0){}
};
 
bool compare_solve(const Team& left, const Team& right){
  return left.solve > right.solve;
}
bool compare_time(const Team& left, const Team& right){
  return left.time <= right.time;
}
 
int main(){
  int H, T, P, R;
  for(;;){
    scanf("%d %d %d %d", &H, &T, &P, &R);
    if( H == 0 && T == 0 && P == 0 && R == 0)
      return 0;
    vector<Present> pr(R);
    for(int i = 0; i < R; i++){
      scanf("%d %d %d %d", &pr[i].m, &pr[i].t, &pr[i].p, &pr[i].j);
    }
    vector<Team> team(T);
    for(int i = 0; i < T; i++){  
      team[i].num = i + 1;
      for(int j = 0; j < R; j++){
    if(pr[j].t == team[i].num){
      if(pr[j].j == 0){
        team[i].solve += 1; 
        team[i].time += pr[j].m;
        for(int k = 0; k < R; k++){
          if(pr[k].t == team[i].num && pr[k].p == pr[j].p && pr[k].j != 0 )
        team[i].time += 20;
        }
      }
    }
      }
    }
    sort(team.begin(),team.end(),compare_time);
    stable_sort(team.begin(),team.end(),compare_solve);
     
    cout << team[0].num;
    for(int i = 1; i < T; i++){
      if(team[i-1].solve == team[i].solve && team[i-1].time == team[i].time)
    cout << "=";
      else
    cout << ",";
      cout << team[i].num;
    }
    cout << endl;
  }
}