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;

struct Team{
    vector<bool> is_solve;
    vector<int> WA;
    int team_id, time, solved;
    Team(){}
    Team(int P, int id){
        is_solve = vector<bool>(P, false);
        WA = vector<int>(P, 0);
        team_id = id;
        time = 0;
        solved = 0;
    }
};
bool operator<(const Team &a, const Team &b){
    if( a.solved == b.solved ){
        if( a.time == b.time ){
            return a.team_id > b.team_id;
        }
        return a.time < b.time;
    }
    return a.solved > b.solved;
}
bool operator==(const Team &a, const Team &b){
    return a.solved == b.solved && a.time == b.time;
}

int main(){
    int M, T, P, R;
    while( cin >> M >> T >> P >> R, M ){
        vector<Team> v;
        for(int i = 0; i < T; i++){
            v.push_back( Team(P, i) );
        }
        
        for(int i = 0; i < R; i++){
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            t--; p--;
            if( j == 0 ){ // Correct Answer
                for(int k = 0; k < v.size(); k++){
                    if( v[k].team_id == t ){
                        v[k].is_solve[p] = true;
                        v[k].solved++;
                        v[k].time += m;
                        v[k].time += 20 * v[k].WA[p];
                        break;
                    }
                }
            }else{ // Wrong Answer
                for(int k = 0; k < v.size(); k++){
                    if( v[k].team_id == t ){
                        v[k].WA[p]++;
                        break;
                    }
                }
            }
        }
        
        sort(v.begin(), v.end());
        for(int i = 0; i < v.size(); i++){
            if( i ){
                bool flag = (v[i-1] == v[i]);
                cout << (flag? "=" : ",");
            }
            cout << v[i].team_id + 1;
        }
        cout << endl;
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ALL(a) (a).begin(),(a).end()
#define F first
#define S second
typedef pair<int,int> PI;


int m,t,p,r;

int app[400][400];
int pena[400];


void solve(){
  memset(app,0,sizeof(app));
  memset(pena,0,sizeof(pena));  
  
  vector<int> sol(10000);
  
  rep(i,r){
    int mk,tk,pk,jk;
    cin >> mk >> tk >> pk >> jk;
    if(jk==0){
      pena[tk] += app[tk][pk]*20+mk;
      ++sol[tk];
    }else{
      ++app[tk][pk];
    }
  }

  vector<pair<PI,int> > team;
  
  rep(i,t){
    team.pb(mp(mp(-sol[i+1],pena[i+1]),-i-1));
  }

  
  sort(ALL(team));
  rep(i,t){
    if(i){
      if(team[i-1].F == team[i].F) cout << "=";
      else cout << ",";
    }
    cout << -team[i].S;
  }
  cout << endl;
}

int main(){
  while(cin >> m >> t >> p >> r && m) solve();
}

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]--;
	}
	map<int, vector<int>> rank;
	rep(i, t) {
		int s = -accumulate(all(v[i]), 0);
		if(rank.count(s)) rank.push_back(i + 1);
		else rank.insert(s, vector<int>{i+1});
	}
	for(auto it = rank.begin(); it != --rank.end(); it++) {
		rep(i, it->size() - 1) cout << it->at(i) << '=';
		cout << it->back();
		cout << ',';
	}
	{
		auto it = --rank.end();
		rep(i, it->size() - 1) cout << it->at(i) << '=';
		cout << it->back();
	}
	cout << endl;
}

C++: #include <cstring>
#include <iostream>
#include <algorithm>
#include <utility>

using namespace std;
typedef pair<int, int> PII;

int WA[10][50];

int main()
{
  int M, T, P, R;
  while (cin>>M>>T>>P>>R, M||T||P||R) {
    memset(WA, 0, sizeof(WA));
    vector<pair<PII, int>> score(T);
    for (int i=0; i<T; i++) {
      score[i].second = -(i+1);
    }

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

      if (!j) {
        //cout << "Team = " << t << ", AC = " << score[t].first.first << endl;

        // AC
        score[t].first.first--;
        score[t].first.second += m + 20*WA[p][t];
      } else {
        // WA 
        WA[p][t]++;
      }
    }

    sort(score.begin(), score.end());
    for (int i=0; i<score.size(); i++) {
      if (i>0) {
        if (score[i].first.first == score[i-1].first.first && score[i].first.second == score[i-1].first.second) cout << "=";
        else cout << ",";
      }
      cout << -score[i].second;
    }
    cout << endl;
  } 
}