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 <algorithm>
#include <vector>
 
using namespace std;
 
struct Node {
    int name;
    int pen;
    int ac;
    vector<int> wa;
    Node(int n, int P) : name(n), pen(0), ac(0), wa(P, 0) { }
    // 0origin
    void accept(int i, int t) {
        ac++;
        pen += wa[i] * 20 + t;
    }
 
    void wrong(int i) {
        wa[i]++;
    }
 
    bool operator <(const Node & n) const {
        if(ac != n.ac) return ac > n.ac;
        if(pen != n.pen) return pen < n.pen;
        return name > n.name;
    }
 
    bool same(const Node & n) const {
        return ac == n.ac && pen == n.pen;
    }
};
 
int main() {
    for(int M, T, P, R; cin >> M >> T >> P >> R, M || T || P || R; ) {
        vector<Node> vec;
        for(int i = 0; i < T; i++) vec.push_back(Node(i+1, P));
        for(int i = 0; i < R; i++) {
            int m, t, p, j; cin >> m >> t >> p >> j;
            t--;
            p--;
            if(j == 0) {
                vec[t].accept(p, m);
            }
            else {
                vec[t].wrong(p);
            }
        }
        sort(vec.begin(), vec.end());
        cout << vec[0].name;
        for(int i = 1; i < (int)vec.size(); i++) {
            if(vec[i - 1].same(vec[i])) cout << "=";
            else cout << ",";
            cout << vec[i].name;
        }
        cout << endl;
    }
}

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

typedef struct {
  int ch[11];
  int num;
  int time;
  int tnum;
} lg;
int M,T,R,P;
vector<lg> team;

bool asc(lg t1,lg t2);

int main(){
  int i,j,m,t,p;

  for(i=0;i<51;i++){
    lg x;
    team.push_back(x);
  }
  while(1){
    cin >> M >> T >> P >> R;
    if(M==0&&T==0&&P==0&&R==0)break;
    for(i=0;i<=T;i++){
      team[i].num=0;
      team[i].time=0;
      team[i].tnum=i+1;
      for(j=0;j<=P;j++)team[i].ch[j]=0;
    }
    for(i=0;i<R;i++){
      cin >> m >> t >> p >> j;
      if(j!=0)team[t-1].ch[p]++;
      else{
	team[t-1].time+=20*team[t-1].ch[p];
	team[t-1].num++;
	team[t-1].time+=m;
      }
    }

    sort(team.begin(),team.begin()+T,asc);

    for(i=0;i<T;i++){
      if(i==0)cout << team[i].tnum;
      else if(team[i-1].num==team[i].num&&team[i-1].time==team[i].time)cout << "="<<team[i].tnum;
      else cout << ","<<team[i].tnum;
    }
    cout << endl;
  }
  return 0;
}

bool asc(lg t1,lg t2){
  if(t1.num>t2.num)return 1;
  else if(t1.num==t2.num&&t1.time<t2.time)return 1;
  else if(t1.num==t2.num&&t1.time==t2.time&&t1.tnum>t2.tnum)return 1;
  else 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;
}