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 <cstdio>
#include <algorithm>

using namespace std;

struct team {
	team() {
		for (int i = 0; i < 10; ++i) {
			ac[i] = -1;
			fa[i] = 0;
		}
	}
	int no;
	int ac[10];
	int fa[10];
	
	int na() const {
		int ans = 0;
		for (int i = 0; i < 10; ++i)
			if (ac[i] != -1)
				++ans;
		return ans;
	}
	
	int st() const {
		int ans = 0;
		for (int i = 0; i < 10; ++i)
			if (ac[i] != -1)
				ans += ac[i] + fa[i] * 20;
		return ans;
	}
	
	bool operator==(const team &rh) {
		return this->na() == rh.na() && this->st() == rh.st();
	}
	
	bool operator<(const team &rh) const {
		if (this->na() > rh.na())
			return true;
		else if (this->na() < rh.na())
			return false;
		
		if (this->st() < rh.st())
			return true;
		else if (this->st() > rh.st())
			return false;
		
		return this->no > rh.no;
	}
};

int main()
{
	for (;;) {
		int m, t, p, r;
		scanf("%d %d %d %d", &m, &t, &p, &r);
		if (m == 0 && t == 0 && p == 0 && r == 0)
			break;
			
		team teams[50];
		for (int i = 0; i < t; ++i)
			teams[i].no = 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 == 0)
				teams[t - 1].ac[p - 1] = m;
			else if (j == 1)
				teams[t - 1].fa[p - 1] += 1;
		}
		
		sort(teams, teams + t);
		
		for (int i = 0; i < t; ++i) {
			printf("%d", teams[i].no);
			if (i == t - 1)
				printf("\n");
			else if (teams[i] == teams[i + 1])
				printf("=");
			else
				printf(",");
		}
	}
	
	return 0;
}

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

typedef pair<int, int> P;

typedef struct{
	int id;
	int solve;
	int time;
	int penal[20];
}Team;


vector< P > ssolve;
int main(void){

	while(1){
		int m, t, p, r;
		Team teams[100];
		cin >> m >> t >> p >> r;
		if(m == 0 && t == 0 && p == 0 && r == 0) break;

		ssolve.clear();
		for(int i=0; i<100; i++){
			teams[i].id = i;
			teams[i].solve = 0;
			teams[i].time = 0;
			for(int j=0; j<20; j++){
				teams[i].penal[j] = 0;
			}
		}

		for(int i=0; i<r; i++){
			int tm, tt, tp, tj;
			cin >> tm >> tt >> tp >> tj;

			tt--;
			if(tj == 0){
				teams[tt].solve++;  
				teams[tt].time += tm;
				if(teams[tt].penal[tp] != 0) {
					teams[tt].time += teams[tt].penal[tp];
					teams[tt].penal[tp] = 0;
				}
			}else{
				teams[tt].penal[tp] += 20;
			}

		}

		for(int i=0; i<t-1; i++){
			for(int j=t-1; j>i; j--){
				if(teams[j].solve > teams[j-1].solve){
					Team tmp = teams[j];
					teams[j] = teams[j-1];
					teams[j-1] = tmp;
				}else if(teams[j].solve == teams[j-1].solve && teams[j].time < teams[j-1].time){
					Team tmp = teams[j];
					teams[j] = teams[j-1];
					teams[j-1] = tmp;
				}else if(teams[j].solve == teams[j-1].solve && teams[j].time == teams[j-1].time && teams[j].id > teams[j-1].id){
					Team tmp = teams[j];
					teams[j] = teams[j-1];
					teams[j-1] = tmp;
				}
			}
		}

		for(int i=0; i<t; i++){
			printf("%d", teams[i].id + 1);
			if(i + 1 != t){
				if(teams[i+1].solve != teams[i].solve){
					printf(",");
				}else if(teams[i+1].solve == teams[i].solve && teams[i+1].time != teams[i].time){
					printf(",");
				}else{
					printf("=");
				}
			}
		}
		puts("");

	}


	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;
}