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

struct team {
	int id, time, count;
};

bool comp(team a, team b) {
	if (b.count > a.count)return true;
	if (b.count == a.count && b.time < a.time)return true;
	if (b.count == a.count && b.time == a.time && b.id > a.id)return true;
	return false;
}

int main() {
	int penalty[51][11];
	int M, T, P, R;
	int m, t, p, j;
	team dat[51];
	int point;
	team sub;

	while (true) {
		scanf("%d%d%d%d", &M, &T, &P, &R);
		if (M == 0 && T == 0 && P == 0 && R == 0)break;

		//penalty data
		for (int i = 1;i <= T;i++) {
			for (int j = 1;j <= 10;j++) {
				penalty[i][j] = 0;
			}
		}
		for (int i = 1;i <= T;i++) {
			dat[i].id = i;
			dat[i].time = 0;
			dat[i].count = 0;
		}
		for (int i = 0;i < R;i++) {
			scanf("%d%d%d%d", &m, &t, &p, &j);
			if (j == 0) {
				dat[t].time += m + penalty[t][p] * 20;
				dat[t].count++;
			}
			else {
				penalty[t][p]++;
			}
		}
		//bubble sort
		for (int i = 1;i <= T;i++) {
			for (int j = T;j > i;j--) {
				if (comp(dat[j - 1], dat[j])) {
					sub = dat[j - 1];
					dat[j - 1] = dat[j];
					dat[j] = sub;
				}
			}
		}
		point = 1;
		while (point <= T) {
			printf("%d", dat[point].id);
			while (point + 1 <= T&&dat[point].count == dat[point + 1].count
				&&dat[point].time == dat[point + 1].time) {
				printf("=%d", dat[point + 1].id);
				point++;
			}
			point++;
			if (point <= T) {
				printf(",");
			}
			else {
				printf("\n");
			}
		}
	}

	return 0;
}

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

#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back

struct Team {
    int num=0, ac=0, pen=0;
    int wa[15] = {0};
};

void solve(int M,int T,int P,int R) {
    vector<Team> teams(T+2);
    rep(i,T) teams[i].num=i+1;
    rep(i,R) {
        int time,tm, prg, msg;
        cin>>time>>tm>>prg>>msg;
        tm--; prg--;
        if(msg == 1) {
            teams[tm].wa[prg]++;
        } else {
            teams[tm].ac++;
            teams[tm].pen += teams[tm].wa[prg] * 20 + time;
        }
    }
    rep(i,T) rep(j,T-1) {
        if(teams[j].ac < teams[j+1].ac) swap(teams[j], teams[j+1]);
        if(teams[j].ac == teams[j+1].ac
                and teams[j].pen > teams[j+1].pen) swap(teams[j], teams[j+1]);
        if(teams[j].ac == teams[j+1].ac
                and teams[j].pen == teams[j+1].pen
                and teams[j].num < teams[j+1].num) swap(teams[j], teams[j+1]);
    }

    /*
    for(auto& team : teams) {
        cout << team.num << " " << team.ac << " " << team.pen << "\n";
    }
    */
    rep(i,T) {
        cout << teams[i].num;
        if(i+1 == T)
            puts("");
        else if(teams[i].ac == teams[i+1].ac and teams[i].pen == teams[i+1].pen)
            cout << '=';
        else
            cout << ',';
    }
}

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

C++: #include <iostream>
#include <queue>
#include <utility>
#include <algorithm>

// 必要な情報
// AC済みかどうか
// ペナルティは何分か
using namespace std;

using pr = pair<long, int>; // first: pts, second: team number;

int penalty[50][10]; // [team][problem number]
// long time[50][10]; // [team][consumed time]
pr pts[50];
priority_queue<int> list;
int m, t, p, r;

int printout(int n, long pre) {
	if (n < t && pre == pts[n].first) {
		list.push(pts[n].second);
		return printout(n+1, pre);
	} else {
		int size = list.size();
		if (size == 0) return 1;
		while (true) {
			cout << list.top();
			list.pop();
			if (list.empty()) break;
			cout << "=";
		}
		return size;
	}

	cout << "ERR" << endl;
	return 0;
}

int main() {
	while (true) {
		cin >> m >> t >> p >> r;
		if (m == 0 && t == 0 && p == 0 && r == 0) break;

		for (int i = 0; i < t; ++i) {
			pts[i].second = i+1;
			pts[i].first = 0;
			for (int j = 0; j < p; ++j)
				penalty[i][j] = 0;
		}
		for (int i = 0; i < r; ++i) {
			int a, b, c, d;
			cin >> a >> b >> c >> d;
			if (d == 0) {
				pts[b-1].first += -10000 + a + penalty[b-1][c-1];
			} else {
				penalty[b-1][c-1] += 20;
			}
		}

		sort(pts, pts + t);
		int i = 0;
		while (true) {
			i += printout(i, pts[i].first);
			if (i >= t)
				break;
			cout << ",";
		}
		cout << endl;
	}

	return 0;
}