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++: #ifndef _WIN32
#include<iostream>
#endif
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<string>
#include<stdlib.h>

#define REP(i,n) for(int i=0;i<n;i++)

using namespace std;
int M, T, P, R;
int score[51];
int times[51];
int pen[51][11];//
int con[51][11];
int team[11]; 

#define SCORE 0
#define TIME 1
#define ID 2
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(30);
	while (1){
		vector<vector<int>> all;
		cin >> M >> T >> P >> R;
		if (M == 0 && T == 0)break;
		REP(i, 51){
			REP(j, 11){
				pen[i][j] = 0;
				con[i][j] = -1;
			}
			score[i] = 0;
			times[i] = 0;
		}

		REP(i, R){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			if (m <= M){
				if (j == 0){
					con[t][p] = m;
				}
				else{
					pen[t][p] ++;
				}
			}
		}
		REP(i, T){
			REP(j, 11){
				if (con[i][j] != -1){
					score[i]++;
					times[i] += con[i][j] + 20 * pen[i][j];
				}
			}
			all.push_back({ score[i], -times[i], i+1 });
		}
		sort(all.begin(), all.end());
		reverse(all.begin(), all.end());
		REP(i, T){
			cout << all[i][ID];
			if (i == T - 1){
				cout << endl;
			}else{
				if (all[i][SCORE] == all[i + 1][SCORE] && all[i][TIME] == all[i+1][TIME]){
					cout << "=";
				}
				else{
					cout << ",";
				}
			}
		}
	}
	return 0;
}

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

int main(){
	int M,T,P,R;
	while(cin>>M>>T>>P>>R,M){
		pair<int, int> team[60];
		int wa[60][20] = {};
		for(int i = 0;i < T;i++){
			team[i].first = team[i].second = 0;
		}
		for(int r = 0;r < R;r++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			t--;
			if(j == 0){
				team[t].first++;
				team[t].second -= m + wa[t][p] * 20;
			}
			else{
				wa[t][p]++;
			}
		}
		int idx[60];
		for(int i = 0;i < 60;i++)idx[i] = i;

		for(int i = 0;i < T;i++){
			for(int j = i+1;j < T;j++){
				if(team[i] == team[j] ? idx[i] < idx[j] : team[i] < team[j]){
					swap(team[i],team[j]);
					swap(idx[i],idx[j]);
				}
			}
		}
		cout<<idx[0]+1;
		for(int i = 1;i < T;i++){
			if(team[i] == team[i-1]){
				cout<<"=";
			}
			else cout<<",";
			cout<<idx[i]+1;
		}
		cout<<endl;
	}

}

C++: #include <iostream>
#include <algorithm>
#include <vector>
static const int N = 2001;
using namespace std;
struct data{
  int correctcnt,time,tnum;
  bool operator<(const data& right)const{
    if(correctcnt!=right.correctcnt) return correctcnt>right.correctcnt;
    if(time!=right.time) return time<right.time;
    return tnum>right.tnum;
  }
};
int main(){
  int M,T,P,R,i,j,m[N],t[N],p[N],in_j[N],incorrectcnt;
  while(1){
    cin >> M >> T >> P >> R;
    vector<data> V(T);
    if(M==0&&T==0&&P==0&&R==0) break;
    for(i=0;i<R;i++){
      cin >> m[i] >> t[i] >> p[i] >> in_j[i];
    }
    for(i=0;i<T;i++){
      V[i].tnum=i+1;
      V[i].correctcnt=V[i].time=0;
    }
    for(i=0;i<R;i++){
      if(in_j[i]==0){
	V[t[i]-1].correctcnt++;
	incorrectcnt=0;
	for(j=0;j<i;j++){
	  if(t[i]==t[j]&&p[i]==p[j]) incorrectcnt++;
	}
	V[t[i]-1].time+=m[i]+20*incorrectcnt;
      }
    }
    sort(V.begin(),V.end());
    for(i=0;i<T-1;i++){
      cout << V[i].tnum;
      if(V[i].correctcnt==V[i+1].correctcnt&&V[i].time==V[i+1].time) cout << '=';
      else cout << ',';
    }
    cout << V[T-1].tnum << endl;
  }  
  return 0;
}

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

class Team{
  public:
    int id;
    int solvednum;
    int penalty;
    vector<bool> solved;
    vector<int> WA;
    Team(int id, int N){
      this->id = id;
      solvednum = 0;
      penalty = 0;
      solved.resize(N, false);
      WA.resize(N, 0);
    }
    bool operator == (const Team &t)const{
      return id == t.id;
    }
    bool operator < (const Team &t)const{
      if(solvednum == t.solvednum){
        if(penalty == t.penalty){
          return id > t.id;
        }
        return penalty < t.penalty;
      }
      return solvednum > t.solvednum;
    }
    string toString(){
      return to_string(id) + " " + to_string(solvednum) + " " + to_string(penalty);
    }
};

int main(void){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int M, T, P, R;
  while(cin >> M >> T >> P >> R, M | T | P | R){
    vector<Team> teams;
    for(int i = 0;  i < T; i++){
      teams.push_back(Team(i+1, P+1));
    }
    for(int asd = 0; asd < R; asd++){
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      t--;
      if(j == 0){
        teams[t].solved[p] = true;
        teams[t].solvednum++;
        teams[t].penalty += m + 20*teams[t].WA[p];
      }else{
        teams[t].WA[p]++;
      }
    }
    sort(teams.begin(), teams.end());

    cout << teams[0].id;
    for(int i = 1; i < T; i++){
      if(teams[i].solvednum == teams[i-1].solvednum && teams[i].penalty == teams[i-1].penalty){
        cout << '=';
      }else{
        cout << ',';
      }
      cout << teams[i].id;
    }
    cout << endl;
  }
  return 0;
}