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

int main(){
  while(true){
    int M,T,P,R;
    cin>>M>>T>>P>>R;

    if(M==0&&T==0&&P==0&&R==0)
      break;

    int CP[50],TT[50],PT[50][10];
    for (int i = 0; i < T; i++) {
        CP[i] = TT[i] = 0;
        for (int j = 0; j < P; j++)
            PT[i][j] = 0;
    }

    for (int i = 0; i < R; i++) {
        int m, t, p, j;
        cin >> m >> t >> p >> j;

        if (j == 0) {
            CP[t - 1]++;
            TT[t - 1] += (m + PT[t - 1][p - 1]);
        }
        else {
            PT[t - 1][p - 1] += 20;
        }
    }

    int tnow, tpre = -1;
    bool flg[50];
    for (int i = 0; i < T; i++)
        flg[i] = false;

    for (int i = 0; i < T; i++) {
        tnow = -1;
        for (int j = 0; j < T; j++) {
            if (flg[j])
                continue;

            if (tnow == -1) {
                tnow == j;
            }
            else {
                if (CP[j] > CP[tnow] || (CP[j] == CP[tnow] && TT[j]>TT[tnow])) {
                    tnow = j;
                }
            }
        }

        if (tpre != -1) {
            if (CP[tnow] == CP[tpre] && TT[tnow] == TT[tpre])
                cout << '=';
            else
                cout << ',';
        }
        cout << tnow + 1;

        flg[tnow] = true;
        tpre = tnow;
    }
    cout << endl;
  }
  return 0;
}

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

class Team{
public:
  int num;
  int solve;
  int time;
  vector<int> plist;
  Team():num(0),solve(0),time(0),plist(vector<int>(10,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 M, T, P, R;
  int m, t, p, j;
  vector<Team> team;
  for(;;){
    scanf("%d %d %d %d", &M, &T, &P, &R);
    if( M == 0 && T == 0 && P == 0 && R == 0)
      return 0;
    for(int i = 0; i < T; i++){  
      Team temp;
      temp.num = i+1;
      team.push_back(temp);
    }
    for(int i = 0; i < R; i++){
      scanf("%d %d %d %d", &m, &t, &p, &j);
      if(j != 0)
	team.at(t-1).plist.at(p) += 1;
      else{
	team.at(t-1).solve += 1; 
	team.at(t-1).time += m;
	team.at(t-1).time += team.at(t-1).plist.at(p) * 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;
    team.clear();
  }
}

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

bool comp(pair<pair<int,int>,int> p1, pair<pair<int,int>,int> p2){

    if(p1.first.first == p2.first.first){
        if(p1.first.second == p2.first.second){
            return p1.second < p2.second;
        }
        return p1.first.second > p2.first.second;
    }
    return p1.first.first < p2.first.second;

}

int main() {

    while(1) {

        int M,T,P,R;

        cin >> M >> T >> P >> R;

        if(M == 0 && T == 0 && P == 0 && R == 0) break;

        pair<int,int> team[T+1]; //solve_num, time
        pair<bool,int> try_progrums[T+1]; //is_tryed, lasttime

        team[0] = make_pair(-1,-1);

        for(int i=1; i<T+1; i++){
            team[i] = make_pair(0,0);
            try_progrums[i] = make_pair(false,0);
        }

        for(int i=0; i<R; i++){

            int m, t, p, j;

            cin >> m >> t >> p >>j;

            if(j == 0){
                team[t].first++;
                team[t].second += m;
            }
            else{
                if(try_progrums[t].first){
                    team[t].second += m - try_progrums[t].second + 20;
                    try_progrums[t].second = m;
                }
                else{
                    try_progrums[t].first = true;
                    try_progrums[t].second = m;
                }
            }
        }

        pair<pair<int,int>,int> team_result[T+1];

        for(int i=0; i<T+1; i++){
            team_result[i] = make_pair(make_pair(team[i].first,team[i].second),i);
        }

        sort(team_result,team_result+T+1,comp);
        
        cout << team_result[T].second;

        for(int i=T; i>1; i--){
            if(team_result[i].first.first == team_result[i-1].first.first && team_result[i].first.second == team_result[i-1].first.second){
                cout << '=' << team_result[i-1].second;
            }
            else{
                cout << ',' << team_result[i-1].second;
            }
        }

        cout << endl;




    }
    return 0;
}