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;

#define rep(i, n) for(int i=0; i<(n); ++i)
#define all(c) (c).begin(), (c).end()

struct State{
    int score, time, num;
    State(int score, int time, int num)
        :score(score), time(time), num(num){}
};

bool operator<(const State &a, const State &b){
    return tie(b.score, b.time, b.num) < tie(a.score, a.time, a.num);
}

bool operator==(const State &a, const State &b){
    return tie(a.score, a.time) == tie(b.score, b.time);
}

int main(){
    int M, T, P, R;
    while(cin >> M >> T >> P >> R, P|T|P|R){
        vector<State> team;
        rep(i, T)team.emplace_back(0, 0, i+1);
        vector<vector<int> > pen(T, vector<int>(P));
        while(R--){
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            t--; p--;
            if(j)pen[t][p]++;
            else{
                team[t].score++;
                team[t].time -= m + 20 * pen[t][p];
            }
        }
        sort(all(team));
        rep(i, T){
            if(i)cout << (team[i-1] == team[i]? '=': ',');
            cout << team[i].num;
        }
        cout << '\n';
    }
    return 0;
}

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

using namespace std;

int main()
{
    while (true) {
        int M, T, P, R;
        cin >> M >> T >> P >> R;
        if (M == 0 && T == 0 && P == 0 && R == 0) {
            return 0;
        }

        struct Problem {
            int time = -1;
            int incorrect = 0;
        };

        vector<vector<Problem>> data(T, vector<Problem>(P));
        for (int i = 0; i < R; ++i) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;

            if (j == 0) {
                data[t - 1][p - 1].time = m;
            }
            else {
                data[t - 1][p - 1].incorrect += 1;
            }
        }

        struct Team {
            int id = 0;
            int correct = 0;
            int time = 0;
        };

        vector<Team> teams(T);
        for (int i = 0; i < T; ++i) {
            teams[i].id = i;
            teams[i].correct = accumulate(begin(data[i]), end(data[i]), 0,
                                          [](int z, const Problem& pp) {
                                              return pp.time >= 0 ? z + 1 : z;
                                          });
            teams[i].time = accumulate(
                begin(data[i]), end(data[i]), 0, [](int z, const Problem& pp) {
                    return pp.time >= 0 ? z + pp.time + 20 * pp.incorrect : z;
                });
        }

        sort(begin(teams), end(teams), [](const Team& a, const Team& b) {
            if (a.correct == b.correct) {
                if (a.time == b.time) {
                    return a.id > b.id;
                }
                else {
                    return a.time < b.time;
                }
            }
            else {
                return a.correct > b.correct;
            }
        });

        for (size_t i = 0; i < teams.size(); ++i) {
            if (i > 0) {
                if (teams[i - 1].correct == teams[i].correct &&
                    teams[i - 1].time == teams[i].time) {
                    cout << '=';
                }
                else {
                    cout << ',';
                }
            }
            cout << (teams[i].id + 1);
        }
        cout << endl;
    }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int MAX_T = 51;
const int MAX_P = 11;
typedef pair<int,int> PP;
typedef pair<PP,int> P;

int main(){
  int m,t,p,r,team[MAX_T][MAX_P],judge[MAX_T][MAX_P];
  int mi,ti,pi,ji,accnt[MAX_T];

  while(cin >> m >> t >> p >> r , m + t + p + r){
    vector<P> v;
    fill(team[0],team[MAX_T],0);
    fill(judge[0],judge[MAX_T],0);
    fill(accnt,accnt+MAX_T,0);

    for(int i = 0 ; i < r ; i++){
      cin >> mi >> ti >> pi >> ji;
      if(ji == 0){
	team[ti][pi] += mi + judge[ti][pi];
	accnt[ti]--;
      }
      else{
	judge[ti][pi] += 20;
      }
    }
    int tt[MAX_T] = {0};
    for(int i = 1 ; i < MAX_T ; i++){
      for(int j = 1 ; j < MAX_P ; j++){
	tt[i] += team[i][j];
      } 
    }
    for(int i = 1 ; i <= t ; i++){
	v.push_back(P(PP(accnt[i],tt[i]),-i));
    }
    sort(v.begin(),v.end());
    for(int i = 1 ; i <= v.size() ; i++){
      if(v[i-1].first.first < v[i].first.first){
	cout << -v[i-1].second;
	if(i != v.size()) cout << ',';
      }
      else{
	if(v[i-1].first.second < v[i].first.second){
	  cout << -v[i-1].second;
	  if(i != v.size()) cout << ',';
	}
	else{
	  cout << -v[i-1].second;
	  if(i != v.size()) cout << '=';
	}
      }
    }
    cout << endl;
  }

  return 0;
}