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 <utility>
using namespace std;

int main(){
  int m,t,p,r,i,j,k;
  while(1){
    cin >> m >> t >> p >> r;
    if(m==0)break;
    int ac[t]={},wa[t][p+1],actime[t]={};
    for(i=0;i<t;i++){
      for(j=0;j<p;j++)wa[i][j]=0;
    }
    for(i=0;i<r;i++){
      int M,T,P,R;
      cin >> M >> T >> P >> R;
      if(R!=0)wa[T-1][P]++;
      else{
        ac[T-1]++;
        actime[T-1]+=wa[T-1][P]*20+M;
      }
    }

    //cout << actime[0] << actime[1] << endl;

    bool flag[t]={};
    int bscore=-1,bfinaltime=-1;
    for(j=0;j<t;j++){
      int team=-1,score=-1,finaltime=300*20;
      for(i=0;i<t;i++){
        if(flag[i]==true)continue;
        if(score<ac[i]){
          team=i;
          score = ac[i];
          finaltime= actime[i];
        }else if(score == ac[i] && finaltime>=actime[i]){
          team=i;
          finaltime=actime[i];
        }
      }
      if(j!=0){
        if(bscore==score && bfinaltime==finaltime)cout << "=";
        else cout << ",";
      }
      cout << team+1;
      flag[team]=true;
      bscore = score;
      bfinaltime=finaltime;
    }
    cout << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>

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

using namespace std;

int main() {
  while(1){
    int m,t,p,r;
    cin>>m>>t>>p>>r;
    if(!m)break;
    vector<vector<int>> v(t,vector<int>(p,-1));
    REP(i,r){
      int M,T,P,J;
      cin>>M>>T>>P>>J;
      --T;--P;
      if(J!=0){
        v[T][P]--;
      }else{
        v[T][P]=M+(1+v[T][P])*(-20);
      }
    }
    vector<tuple<int,int,int>> a;
    REP(i,t){
      int ac=0;
      int pen=0;
      REP(j,p){
        if(v[i][j]>=0){
          ++ac;
          pen += v[i][j];
        }
      }
      a.emplace_back(-ac,pen,-(i+1));
    }
    sort(begin(a),end(a));
    bool nzero=false;
    for(auto itr=begin(a);itr!=end(a);++itr){
      int ac,pen,tn;
      tie(ac,pen,tn) = *itr;
      if(itr!=begin(a)){
        int pac,ppen;
        tie(pac, ppen, ignore) = *prev(itr);
        if(pac==ac&&ppen==pen){
          cout<<'=';
        }else{
          cout<<',';
        }
      }
      cout<<-tn;
    }
    cout<<endl;
  }
  return 0;
}

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

int main(){
  vector<pair<int , pair<int,int> > > vppa;
  pair<int,int> pa;
  pair<int,pair<int,int> > ppa;
  int m,t,p,r,mm,tt,pp,jj,seikai[60],h[60][20];
  while(1){
    cin>>m>>t>>p>>r;
    if(m==0)break;
    for(int i=0;i<=t;i++){
      for(int j=0;j<=p;j++){
	h[i][j]=0;
      }
    }
    for(int i=0;i<=t;i++)seikai[i]=0;
    
    for(int i=0;i<r;i++){
      cin>>mm>>tt>>pp>>jj;
      if(jj!=0)h[tt][pp]--;
      else {
	h[tt][pp]=(h[tt][pp]*-1)*20+mm;
	seikai[tt]++;
      }
    }
    /* for(int i=0;i<=t;i++){////////////
      for(int j=0;j<=p;j++){
	cout<<h[i][j]<<" ";
      }
      cout<<endl;
      }*/

    vppa.clear();
    for(int i=1;i<=t;i++){
      pa.second=i*-1;
      pa.first=0;
      for(int j=1;j<=p;j++){
	if(h[i][j]>0) {
	  pa.first+=h[i][j];
	}
      }
      ppa.second=pa;
      ppa.first=seikai[i]*-1;
      vppa.push_back(ppa);
    }

    sort(vppa.begin() , vppa.end());

    for(int i=0;i<vppa.size()-1;i++){
      cout<<vppa[i].second.second*-1;
      if(vppa[i].first==vppa[i+1].first && vppa[i].second.first==vppa[i+1].second.first){
	cout<<"=";
      }else cout<<",";
    }
    cout<<vppa[vppa.size()-1 ].second.second*-1<<endl;
  }
  return 0;
}

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

typedef pair<int,int> pii;
typedef pair<pii,int> tri;
int main(){
  int m,t,p,r;
  int team[55][15];
  while(cin>>m>>t>>p>>r,m){
    memset(team,0,sizeof(team));
    vector<tri> ans;
    int a,b,c,d;
    for(int i=0;i<r;i++){
      cin>>a>>b>>c>>d;
      if(d!=0){
	team[b][c]++;
      }else{
	team[b][p+1]+=a+20*team[b][c];
	team[b][p+2]++;
      }
    }
    for(int i=1;i<=t;i++){
      ans.push_back(tri(pii(-team[i][p+2],team[i][p+1]),-i));
    }
    sort(ans.begin(),ans.end());
    for(int i=0;i<t;i++){
      cout<<-ans[i].second;
      if(i+1==t)cout<<endl;
      else if(ans[i].first == ans[i+1].first)cout<<"=";
      else cout<<",";
    }
  }
}