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

#include <cmath>
#include <iomanip>
#include <vector>

using namespace std;
#define int ll
#define ll long long

#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define REP(i, n) for (int i = 0; i < (int)n; ++i)

signed main() {
  int M, T, P, R;
  while(cin >> M >> T >> P >> R, M||T||P||R){
    struct Team{
      vector<int> cnt;
      vector<int> acTime;
      int sum, time;
      int idx;

      Team(int p) : cnt(p, 0), acTime(p, -1), sum(-1), time(-1), idx(-1) {}
      void calc(){
        if(sum != -1) return;
        sum = time = 0;
        REP(i, cnt.size()) {
          if(acTime[i] == -1) continue;
          ++sum;
          time += acTime[i] + 20 * cnt[i];
        }
      }

      bool operator<(const Team& r) const {
        if(sum != r.sum) return sum > r.sum;
        if(time != r.time) return time < r.time;
        return idx > r.idx;
      }
      bool operator==(const Team& r) const {
        return sum == r.sum && time == r.time;
      }
    };

    vector<Team> teams(T, Team(P));
    REP(i, T) teams[i].idx = i + 1;
    REP(i, R) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      --t; --p;
      if(j == 0) {
        teams[t].acTime[p] = m;
      }else {
        teams[t].cnt[p]++;
      }
    }

    REP(i, T) teams[i].calc();
    std::sort(ALL(teams));

    Team pre(0);
    REP(i, T) {
      if(i != 0) {
        if(pre == teams[i]) {
          cout << '=';
        }else {
          cout << ',';
        }
      }
      cout << teams[i].idx;
      pre = teams[i];
    }
    cout << endl;
  }

  return 0;
}

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

int main(){
    int M, T, P, R;
    cin >> M >> T >> P >> R;
    while(M > 0){
        vector<pair<pair<int, int>, int>> ans(T);
        for(int i=0; i<T; i++){
            ans[i].first = make_pair(P, 0);
            ans[i].second = -i;
        }
        vector<vector<int>> pen(T, vector<int>(P, 0));
        for(int i=0; i<R; i++){
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            t--; p--;
            if(j == 0){
                ans[t].first.first--;
                ans[t].first.second += m + pen[t][p];
            }else{
                pen[t][p] += 20;
            }
        }
        sort(ans.begin(), ans.end());
        for(int i=0; i<T; i++){
            cout << -ans[i].second+1;
            if(i<T-1) cout << (ans[i].first == ans[i+1].first ? "=":",");
        }
        cout << endl;

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

C++: #include <bits/stdc++.h> 
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) { }

    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() {
    int M,T,P,R; 
    while(1){
        cin>>M>>T>>P>>R;
        if(M ==0 && T == 0 && P == 0 && R == 0) break;
        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;
    }
}