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>

#define loop(n, i) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;

using namespace std;
typedef long long ll;


int main()
{
    int M, T, P, R;
    while (cin >> M >> T >> P >> R, M) {
        vector<vector<int>> result(T, vector<int>(3+P,0));
        loop(T,i) result[i][0] = i+1;
        loop(R,i) {
             int m, t, p, j;
             cin >> m >> t >> p >> j;
             if (j) {
                 if (result[t-1][p+2] != -1) result[t-1][p+2]++;
             } else {
                 if (result[t-1][p+2] != -1) {
                     result[t-1][1]++;
                     result[t-1][2] += result[t-1][p+2]*20 + m;
                     result[t-1][p+2] = -1;
                 }
             }
        }
        
        sort(all(result),
                [](vector<int> a, vector<int> b) {
                    if(a[1] != b[1]) return a[1] > b[1];
                    if(a[2] != b[2]) return a[2] < b[2];
                    return a[0] > b[0];
                });
            
        loop(T,i) {
            cout << result[i][0];
            if (i==T-1) {
                cout << endl;
            } else if (result[i][1] == result[i+1][1]
                    && result[i][2] == result[i+1][2])
                cout << '=';
            else cout << ',';
        }
    }
}

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


struct record{
  int team;
  int solve;
  int time;
  vector< int > wa;
  
};

int getPenalty(record data, int pass){
  int cnt=0;
  for(int i=0;i<data.wa.size();i++){
    if(pass==data.wa[i])
      cnt++;
  }
  return cnt*20;

}

bool cmp(const record& a,const record& b){
  if(a.solve!=b.solve) return a.solve>b.solve;
  if(a.time!=b.time) return a.time<b.time;
  return a.team > b.team;

}

int main(){
  
  int m,t1,p,r;
  int t2,f;

  while(1){
    cin>>m>>t1>>p>>r;
    if(m==0 && t1==0 && p==0 && r==0) break;
    record record[t1];
    for(int i=0;i<t1;i++){
      record[i].team=i+1;
      record[i].solve=0;
      record[i].time=0;
    }
    
    for(int i=0;i<r;i++){
      cin>>m>>t2>>p>>f;
      if(f==0){
	record[t2-1].solve++;
	record[t2-1].time+=m+getPenalty(record[t2-1],p);
      }else{
	record[t2-1].wa.push_back(p);
      }
    }
    
    sort(record,record+t1,cmp);
    
    for(int i=0;i<t1;i++){
      printf("%d",record[i].team);
      if(i==t1-1) break;
      if(record[i].solve!=record[i+1].solve)
	printf(",");
      else{
	if(record[i].time!=record[i+1].time) printf(",");
	else printf("=");
      }
    }
    puts("");
  }
  return 0;
}

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

#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define all(co) begin(co), end(co)

int main() {
	int m,t,p,r;
while (cin >> m >> t >> p >> r && m) {
	vector<vector<int>> v(t, vector<int>(p));
	rep(i, r) {
		int m, t, p, j; cin >> m >> t >> p >> j;
		t--;
		if (j == 0) {
			if(v[t][p] == 0) v[t][p] = m;
			else v[t][p] = m + -v[t][p] * 20;
		}
		else v[t][p]--;
	}
	map<int, vector<int>> rank;
	rep(i, t) {
		int s = -accumulate(all(v[i]), 0);
		if(rank.count(s)) rank[s].push_back(i + 1);
		else rank.emplace(s, vector<int>{i+1});
	}
	for(auto it = rank.begin(); it != --rank.end(); it++) {
		auto& v = it->second;
		rep(i, v.size() - 1) cout << v.at(i) << '=';
		cout << v.back();
		cout << ',';
	}
	{
		auto it = --rank.end();
		auto& v = it->second;
		rep(i, v.size() - 1) cout << v.at(i) << '=';
		cout << v.back();
	}
	cout << endl;
}