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>
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;

struct teamscore{
  int team, correct, time;
  int wrong[10];
};

bool comp(const teamscore &a, const teamscore &b)
{
  if(a.correct != b.correct)
    return a.correct > b.correct;
  else if(a.time != b.time)
    return a.time < b.time;
  else
    return a.team > b.team;
}

int main()
{
  while(1){
    int M,T,P,R;
    cin >> M >> T >> P >> R;
    if(M == 0 && T == 0 && P == 0 && R == 0) break;
    vector<teamscore> v(T);
    REP(i,T){
      v[i].team = i+1;
      v[i].correct = v[i].time = 0;
      REP(j,10)
        v[i].wrong[j] = 0;
    }
    REP(i,R){
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      if(j != 0){
        v[t-1].wrong[p-1]++;
      }else{
        v[t-1].time += v[t-1].wrong[p-1]*20 + m;
        v[t-1].correct++;
      }
    }
    sort(v.begin(), v.end(), comp);
    cout << v[0].team;
    for(int i = 1; i < T; i++){
      if(v[i].correct == v[i-1].correct && v[i].time == v[i-1].time)
        cout << "=" << v[i].team;
      else
        cout << "," << v[i].team;
    }
    cout << endl;
  }
}

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

using namespace std;

class Question{
public:
    bool isAC = false;
    int p = 0;
};
class Team{
public:
    int ID;
    int AC = 0;
    int ptime = 0;
    vector<Question> q;

    Team() : ID(-1){}
    Team(int id,int qn)
        : ID(id), q(qn+1)
    {
    }

    void submit(int m,int p,int j){
        if(j == 0){
            q[p].p += m;
            q[p].isAC = true;
            AC++;
            ptime += q[p].p;
        }else{
            q[p].p += 20;
        }
    }
};

bool operator==(const Team& a,const Team& b){
    return a.AC == b.AC && a.ptime == b.ptime;
}
bool operator!=(const Team& a,const Team& b){
    return !(a == b);
}

//M:テァツオツづ、ツコツ?ヲツ卍づゥツ鳴?
//T:テ」ツδ?」ツδシテ」ツδ?ヲツ閉ー
//P:テ・ツ閉湘ゥツ。ツ古ヲツ閉ー
//R:テヲツ渉静・ツ?コテヲツ閉ー
void solve(int M,int T,int P,int R){
    vector<Team> team;
    for(int i=1;i<=T;i++){
        team.push_back(Team(i,P));
    }
    for(int i=0;i<R;i++){
        int m,t,p,j;
        cin >> m >> t >> p >> j;
        team[t-1].submit(m,p,j);
    }
    std::sort(team.begin(),team.end(),
            [](const Team& a,const Team& b)->bool{
                if(a.AC < b.AC)
                    return true;
                if(a.AC > b.AC)
                    return false;
                return a.ptime > b.ptime;
            }
            );
    std::reverse(team.begin(),team.end());
    bool f = false;
    cout << team[0].ID;
    for(int i=1;i<T;i++){
        if(team[i-1] == team[i]){
            cout << "=" << team[i].ID;
        }else{
            cout << "," << team[i].ID;
        }
    }
    //for(auto t : team)
    //{
    //    //cout << t.ID << " :" << t.AC << " ," << t.ptime << endl;
    //}
    cout << endl;
}

int main(){
    while(true){
        int M,T,P,R;
        cin >> M >> T >> P >> R;
        if(!M&&!T&&!P&&!R)
            return 0;
        solve(M,T,P,R);
    }
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <utility>
#include <cmath>
using P = std::pair<int, int>;
using namespace std;

struct team_data {
    int team_num = -1;
    int solved_num = 0;
    int sum_time = 0;    // minute
    //vector<int> solved_time;
    vector<int> penalty;
};

int main() {
    int M, T, P, R;
    while(cin >> M >> T >> P >> R, M) {
        vector<team_data> v(T);
        for(int i=0; i<v.size(); ++i) {
            v[i].team_num = i+1;
            v[i].penalty.resize(P);
        }
        for(int i=0; i<R; ++i) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            if(j != 0) {
                v[t-1].penalty[p-1] += 20;
            } else {
                v[t-1].sum_time += m;
                v[t-1].solved_num += 1;
                v[t-1].sum_time += v[t-1].penalty[p-1];
            }
        }
        vector<vector<team_data>> v2(P+1);
        for(auto& x : v) {
            v2[x.solved_num].push_back(x);
        }
        for(auto& x : v2) {
            sort(x.begin(), x.end(), [](team_data const& t1, team_data const& t2) {
                    return t1.team_num > t2.team_num;
                    });
            stable_sort(x.begin(), x.end(), [](team_data const& t1, team_data const& t2) {
                    return t1.sum_time < t2.sum_time;
                    });
        }
        vector<team_data> ret;
        for(int i=v2.size()-1; i>=0; --i) {
            for(auto& x2 : v2[i]) {
                ret.push_back(x2);
            }
        }
        for(int i=0; i<ret.size(); ++i) {
            if(i != 0) {
                if(ret[i-1].solved_num == ret[i].solved_num) {
                    if(ret[i-1].sum_time == ret[i].sum_time) cout << '=';
                    else cout << ',';
                } else {
                    cout << ',';
                }
            }
            cout << ret[i].team_num;
        }
        cout << endl;
    }
}