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;

int M, T, P, R;

struct Team{
	int id, ac, timecost;
	int wa[11];
	Team(int i){
		id = i;
		ac = 0; timecost = 0;
		for(int i = 0; i < 11; i++) wa[i] = 0;
	}
};

bool compare(const Team &a, const Team &b){
	if(a.ac != b.ac) return a.ac > b.ac;
	else if(a.timecost != b.timecost) return a.timecost < b.timecost;
	else return a.id > b.id;
}

int main(){
	while(cin >> M >> T >> P >> R && M != 0){
		vector<Team> teams;
		for(int i = 0; i < T; i++){
			Team t(i);
			teams.push_back(t);
		}

		for(int i = 0; i < R; i++){
			int m, t, p, j;
			cin >> m >> t >> p >>j;
			if(j == 0){
				teams[t-1].ac++;
				teams[t-1].timecost += m + teams[t-1].wa[p] * 20;
			}else{
				teams[t-1].wa[p]++;
			}
		}

		sort(teams.begin(), teams.end(), compare);

		int p_ac = -1, p_tc = -1;
		for(int i = 0; i < T; i++){
			if (i>0) {
				if(teams[i-1].ac== teams[i].ac && teams[i-1].timecost == teams[i].timecost) cout << "=";
				else cout << ",";	
			}
			cout << teams[i].id+1;
		}
		cout << endl;
	}
	return 0;
}

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

struct team{
	int n, c, t, p;
};

bool operator<(const team team1, const team team2){
	bool rep;
	if(team1.c == team2.c){
		rep = (team1.t == team2.t) ? team1.n > team2.n : team1.t < team2.t;
	}else{
		rep = (team1.c > team2.c);
	}
	return rep;
}

int main(){
	int M, T, P, R;
	while( cin >> M >> T >> P >> R, M || T || P || R ){
		vector<team> teams(T);
		for(int i = 0; i < T; i++){
			teams[i].n = i+1;
			teams[i].c = 0;
			teams[i].t = 0;
			teams[i].p = 0;
		}
		for(int i = 0; i < R; i++){
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if( j == 0 ){
				teams[t-1].c++;
				teams[t-1].t += (m + 20 * teams[t-1].p);
				teams[t-1].p = 0;
			}else{
				teams[t-1].p++;
			}
		}
		sort(teams.begin(), teams.end());
		cout << teams[0].n;
		for(int i = 1; i < T; i++){
			if( teams[i].c == teams[i-1].c && teams[i].t == teams[i-1].t ) cout << "=";
			else cout << ",";
			cout << teams[i].n;
		}
		cout << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
 
typedef struct {
  int ch[11];
  int num;
  int time;
  int tnum;
} lg;
int M,T,R,P;
vector<lg> team;
 
bool asc(lg t1,lg t2);
 
int main(){
  int i,j,m,t,p;
 
  for(i=0;i<51;i++){
    lg x;
    team.push_back(x);
  }
  while(1){
    cin >> M >> T >> P >> R;
    if(M==0&&T==0&&P==0&&R==0)break;
    for(i=0;i<=T;i++){
      team[i].num=0;
      team[i].time=0;
      team[i].tnum=i+1;
      for(j=0;j<=P;j++)team[i].ch[j]=0;
    }
    for(i=0;i<R;i++){
      cin >> m >> t >> p >> j;
      if(j!=0)team[t-1].ch[p]++;
      else{
    team[t-1].time+=20*team[t-1].ch[p];
    team[t-1].num++;
    team[t-1].time+=m;
      }
    }
 
    sort(team.begin(),team.begin()+T,asc);
 
    for(i=0;i<T;i++){
      if(i==0)cout << team[i].tnum;
      else if(team[i-1].num==team[i].num&&team[i-1].time==team[i].time)cout << "="<<team[i].tnum;
      else cout << ","<<team[i].tnum;
    }
    cout << endl;
  }
  return 0;
}
 
bool asc(lg t1,lg t2){
  if(t1.num>t2.num)return 1;
  else if(t1.num==t2.num&&t1.time<t2.time)return 1;
  else if(t1.num==t2.num&&t1.time==t2.time&&t1.tnum>t2.tnum)return 1;
  else return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int x[99][2],y[99][20],n,a,b,c,d,e,f,g,h,p,i,j,k;
int main() {
while(true) {
memset(x,0,sizeof(x));memset(y,0,sizeof(y));
cin>>n>>a>>b>>c;
if(n==0){break;}
for(i=0;i<c;i++){
cin>>d>>e>>f>>g;
if(g!=0){y[e][f]+=20;}
else{x[e][1]+=d+y[e][f];x[e][0]++;}
}p=0;
for(i=b;i>=0;i--){
for(j=0;j<=99999;j++){h=0;
for(k=a;k>0;k--){
if(x[k][0]==i&&x[k][1]==j){
if(h>=1){cout<<'=';}else if(p>=1){cout<<',';}cout<<k;p++;h++;
}
}}}
cout<<endl;}}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <functional>

using namespace std;

int time[51][11];
bool memo[51][11];

int main(void){
  int M, T, P, R;
  int m, t, p, j;
  vector<pair<int, pair<int, int> > > v;

  while(cin >> M >> T >> P >> R, M || T || P || R){
    v.clear();

    for(int i=1; i<=T; i++){
      for(int k=1; k<=P; k++){
        time[i][k] = 0;
        memo[i][k] = false;
      }
    }

    for(int i=0; i<R; i++){
      cin >> m >> t >> p >> j;
      if(j == 0){
        time[t][p] += m;
        memo[t][p] = true;
      } else {
        time[t][p] += 20;
      }
    }

    for(int i=1; i<=T; i++){
      int t = 0, c = 0;
      for(int k=1; k<=P; k++){
        if(memo[i][k] == true){
          ++c;
          t += time[i][k];
        }
      }

      v.push_back(make_pair(c, make_pair(-1 * t, i)));
    }
    sort(v.begin(), v.end(), greater<pair<int, pair<int, int> > >());
    
    cout << v[0].second.second;
    int tbuf = v[0].second.first, mbuf = v[0].first;
    for(int i=1; i<v.size(); i++){
      if(tbuf == v[i].second.first && mbuf == v[i].first){
        cout << "=" << v[i].second.second;
      } else {
        cout << "," << v[i].second.second;
        tbuf = v[i].second.first; mbuf = v[i].first;
      }
    }
    cout << endl;
  }

  return 0;
}