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>
#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 << endl;
  }
  return 0;
}

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

class Present{
public:
  int m;
  int t;
  int p;
  int j;
  Present():m(0),t(0),p(0),j(0){}
};
class Team{
public:
  int num;
  int solve;
  int time;
  Team():num(0),solve(0),time(0){}
};

bool compare_solve(const Team& left, const Team& right){
  return left.solve > right.solve;
}
bool compare_time(const Team& left, const Team& right){
  return left.time <= right.time;
}

int main(){
  int H, T, P, R;
  for(;;){
    scanf("%d %d %d %d", &H, &T, &P, &R);
    if( H == 0 && T == 0 && P == 0 && R == 0)
      return 0;
    vector<Present>  *pr = new vector<Present>(R);
    for(int i = 0; i < R; i++){
      scanf("%d %d %d %d", &pr->at(i).m, &pr->at(i).t, &pr->at(i).p, &pr->at(i).j);
    }
    vector<Team> *team = new vector<Team>(T);
    for(int i = 0; i < T; i++){  
      team->at(i).num = i + 1;
      for(int j = 0; j < R; j++){
	if(pr->at(j).t == team->at(i).num){
	  if(pr->at(j).j == 0){
	    team->at(i).solve += 1; 
	    team->at(i).time += pr->at(j).m;
	    for(int k = 0; k < R; k++){
	      if(pr->at(k).t == team->at(i).num && pr->at(k).p == pr->at(j).p && pr->at(k).j != 0 )
		team->at(i).time += 20;
	    }
	  }
	}
      }
    }
    sort(team->begin(),team->end(),compare_time);
    stable_sort(team->begin(),team->end(),compare_solve);
    
    cout << team->at(0).num;
    for(int i = 1; i < T; i++){
      if(team->at(i-1).solve == team->at(i).solve && team->at(i-1).time == team->at(i).time)
	cout << "=";
      else
	cout << ",";
      cout << team->at(i).num;
    }
    cout << endl;
    delete pr;
    delete team;
  }
}

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

struct S {
    int id, ac, time, wa[10];
};

bool comp(S a, S b) {
    if (a.ac != b.ac) return a.ac > b.ac;
    if (a.time != b.time) return a.time < b.time;
    return a.id > b.id;
}

bool comp2(S a, S b) {
    if (a.ac != b.ac) return a.ac > b.ac;
    if (a.time != b.time) return a.time < b.time;
    return false;
}

int main() {
    int M, T, P, R;
    while (cin >> M >> T >> P >> R, M) {
        S team[50];
        for (int i = 0; i < T; i++) {
            team[i].id = i + 1;
            team[i].ac = 0;
            team[i].time = 0;
            fill_n((int*)team[i].wa, 10, 0);
        }
        for (int i = 0; i < R; i++) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            t--;
            p--;
            if (!j) {
                team[t].ac++;
                team[t].time += m + team[t].wa[p] * 20;
            } else {
                team[t].wa[p]++;
            }
        }
        sort(team, team + T, comp);
        for (int i = 0; i + 1 < T; i++) {
            cout << team[i].id;
            if (comp2(team[i], team[i + 1])) {
                cout << ",";
            } else {
                cout << "=";
            }
        }
        cout << team[T - 1].id << endl;
    }
}