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 <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
#define rep(i, n) for(int i=0; i<(n); ++i)

class team {
public:
    int id, solve, time, miss[11];
    bool operator<(const team & rhs) const{
        return solve < rhs.solve || (solve==rhs.solve && time > rhs.time); 
    }  
};
int main(void){
    int M, T, P, R;
    int m, t, p, j;
    team teams[51];
    while(cin >> M >> T >> P >> R && M) {
        rep(i, T) {
            teams[i].id = i+1;
            teams[i].solve = 0;
            teams[i].time = 0;
            rep(j, P) teams[i].miss[j] = 0;
        }
        rep(i, R) {
            cin >> m >> t >> p >> j;
            t--;
            if(j == 0) {
                teams[t].solve++;
                teams[t].time += m + teams[t].miss[p] * 20;
            } else {
                teams[t].miss[p]++;
            }
        }
        sort(teams, teams+T);
        for(int i=T-1; i>0; --i) {
            cout << teams[i].id;
            if(teams[i].solve==teams[i-1].solve && teams[i].time==teams[i-1].time) {
                cout << "=";
            } else {
                cout << ",";
            }
        }
        cout << teams[0].id << endl;
    }
}

C++: #include <iostream>
#define N 2002
using namespace std;
struct team{
  int tnum;
  int correct;
  int time;
};
int main(){
  int m,t,p,r,im[N],it[N],ip[N],ij[N],incorrect,i,j;
  struct team data[51];
  while(1){
    cin >> m >> t >> p >> r;
    if(m==0&&t==0&&p==0&&r==0) break;
    for(i=0;i<r;i++) cin >> im[i] >> it[i] >> ip[i] >> ij[i];
    for(i=1;i<=t;i++){
      data[i].tnum=i;
      data[i].correct=0;
      data[i].time=0;
    }
    for(i=0;i<r;i++){
      if(ij[i]==0){
	data[it[i]].correct++;
      	incorrect=0;
	for(j=0;j<i;j++){
	  if(it[i]==it[j]&&ip[i]==ip[j]) incorrect++;
	}
	data[it[i]].time=data[it[i]].time+incorrect*20+im[i];
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].tnum>data[j-1].tnum) swap(data[j],data[j-1]);
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].time<data[j-1].time) swap(data[j],data[j-1]);
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].correct>data[j-1].correct) swap(data[j],data[j-1]);
      }
    }
    for(i=1;i<t;i++){
      cout << data[i].tnum;
      if(data[i].correct==data[i+1].correct&&data[i].time==data[i+1].time)
	cout << '=';
      else cout << ',';
      // if(i==t-1) cout << data[i+1].tnum;
    }
    cout << data[t].tnum << endl;
  }
  return 0;
}

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[p]=true;
            time += m;
            time += WA_cnt[p]*20;
        }
        else {
            WA_cnt[p]++;
            
        }
    }
    bool operator<(const Trem& t1) const {
        if(this->AC_cnt != t1.AC_cnt) {
            return this->AC_cnt > t1.AC_cnt;
        }
        if(this->time != t1.time) return this->time < t1.time;
        return this->id > t1.id;
    }

};

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 <bits/stdc++.h>

using namespace std;

int main()
{
    int M, T, P, R;
    
    while (scanf("%d %d %d %d", &M, &T, &P, &R) && M){
        vector<pair<pair<int, int>, int> > record(T);
        int wa[64][16] = {0};
        
        for (int i = 0; i < T; i++) record[i].second = -(i + 1);
        
        for (int i = 0; i < R; i++){
            int m, t, p, j;
            scanf("%d %d %d %d", &m, &t, &p, &j);
            if (j) wa[t - 1][p] += 20;
            else {
                record[t - 1].first.first--;
                record[t - 1].first.second += m + wa[t - 1][p];
            }
        }
        
        sort(record.begin(), record.end());
        
        for (int i = 0; i < T; i++){
            printf("%d", -record[i].second);
            if (i + 1 < T && record[i].first == record[i + 1].first) printf("=");
            else if (i + 1 < T) printf(",");
            else printf("\n");
        }
    }
    
    return (0);
}