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;
void swapp(int*,int*);
int main(){
  while(1){
    int M,T,P,R;
    cin >> M >> T >> P >> R;
    if(M==0&&T==0&&P==0&&R==0)break;
    int te[51];
    int tr[51];
    int tp[51]={};
    int tt[51]={};
    vector<vector<int> >ts(T+1,vector<int>(P,0));
    for(int i=0;i<R;i++){
      int m,t,p,j;
      cin >> m >> t >> p >> j;
      if(j==0){
	tt[t]+=ts[t][p]+m;
	tp[t]++;
      }
      else{
	ts[t][p]+=20;
      }
    }
    for(int i=1;i<=T;i++){
      //
      // cout << i<<" "<<tp[i]<< " "<< tt[i]<<endl;
      //
      tr[i]=i;
      te[i]=0;
    }
    //sort
    for(int i=1;i<=T;i++){
      for(int j=1;j<T;j++){
	if(tp[j]<tp[j+1]){
	  //  cout << tr[j]<<" "<<tr[j+1]<<endl;
	  swapp(tr+j,tr+j+1);
	  swapp(te+j,te+j+1);
	  swapp(tt+j,tt+j+1);
	  swapp(tp+j,tp+j+1);
	  //  cout << tr[j]<<" "<<tr[j+1]<<endl;
	}
	else if(tp[j]==tp[j+1]){
	  if(tt[j]>tt[j+1]){
	    swapp(tr+j,tr+j+1);
	    swapp(te+j,te+j+1);
	    swapp(tt+j,tt+j+1);
	    swapp(tp+j,tp+j+1);
	  }
	  else if(tt[j]==tt[j+1]){
	    if(tr[j]<tr[j+1]){
	      swapp(tr+j,tr+j+1);
	      swapp(te+j,te+j+1);
	      swapp(tt+j,tt+j+1);
	      swapp(tp+j,tp+j+1);
	    }
	    te[j]=1;
	    
	  }
	}
      }
    }
    // for(int i=1;i<=T;i++)  cout << i<<" "<<tp[i]<< " "<< tt[i]<<endl;
    for(int i=1;i<=T;i++){

      cout << tr[i];
      if(i<T){
	if(te[i]==1){
	  cout << '=';
	}
	else cout << ',';
      }
    }
    cout << endl;
  }
  return 0;
}
void swapp(int*m,int*a){
  int b;
  b=*m;
  *m=*a;
  *a=b;
return;
}

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

using namespace std;

int M,T,P,R;

class Trem {
public:

    int id;
    int AC_cnt;
    int WA_cnt[13];
    int time;
    bool is_AC[13];
    Trem() {
    }
    Trem(int i) {
        this->id = i;
        AC_cnt=0;
        time=0;
        for(int i=0;i<13;i++) {
            WA_cnt[i]=0;
            is_AC[i]=false;
        }
    }
    void submit(int m,int t,int p,int j) {
        if(j==0) {
            AC_cnt++;
            is_AC[t]=true;
            time += m;
            time += WA_cnt[t]*20;
        }
        else {
            WA_cnt[t]++;
            
        }
    }
    bool operator<(const Trem& t1) const {
        if(this->AC_cnt == t1.AC_cnt) {
            if(this->time == t1.time) return this->id > t1.id;
            else return this->time < t1.time;
        }
        else {
            return this->AC_cnt > t1.AC_cnt;
        }
    }

};

void solve() {
    Trem trem[53];
    for(int i=0;i<53;i++) trem[i]=Trem(i);
    for(int i=0;i<R;i++) {
        int m,t,p,j;
        cin>>m>>t>>p>>j;
        trem[t].submit(m,t,p,j);
    }
    sort(trem+1,trem+T+1);
    for(int i=1;i<=T;i++) {
        Trem t = trem[i];
        Trem next = trem[i+1];
        char c = ((t.AC_cnt==next.AC_cnt && 
                t.time == next.time)?'=':',');
        if(i==T) c='\n';
        cout<<t.id;
        cout<<(c);
    }

    

}

int main() {
    while(cin>>M>>T>>P>>R) {
        if(M+T+P+R==0) return 0;
        solve();
    }

    return 0;
}

C++: #include <iostream>
#include <sstream>
#include <fstream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
using namespace std;

struct score {
	int teamNum;
	int accepted;
	int time;
	vector<int> miss;
	bool operator==(score s) const {
		return this->accepted == s.accepted && this->time == s.time;
	};
	bool operator<(score s) const {
		return this->accepted != s.accepted ? this->accepted > s.accepted : (this->time != s.time ? this->time < s.time : this->teamNum > s.teamNum);
	};
};

int main() {
	while(1){
		int M, T, P, R;
		cin >> M >> T >> P >> R;
		
		if(!M && !T && !P && !R) break;
		
		score *sc = new score[1+T];
		for(int i = 1; i <= T; i++){
			sc[i].teamNum = i;
		}
		for(int i = 0; i < R; i++){
			int m, t, p, r;
			cin >> m >> t >> p >> r;
			
			if(r){
				sc[t].miss.push_back(p);
			}else{
				sc[t].accepted++;
				sc[t].time += m + 20 * count(sc[t].miss.begin(), sc[t].miss.end(), p);
			}
		}
		
		sort(&sc[1], &sc[1+T]);
		for(int i = 1; i <= T; i++){
			cout << sc[i].teamNum << (i==T ? '\n' : (sc[i]==sc[i+1] ? '=' : ','));
		}
	}
	return 0;
}