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 <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <stack>

using namespace std;

#define INF 1010001000
#define EPS 1e-10
#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

typedef pair<int, int> i_i;
typedef long long int llong;
typedef pair<llong, llong> ll_ll;
typedef struct edge {int f, t;}Edge;
typedef pair<int, pair<int, int> > Team;
typedef pair<int, pair<int, pair<int, int> > > input;

int m, t, p, r;

int main()
{
    while (cin >> m >> t >> p >> r, m) {
        vector<Team > team(t);
        vector<vector<int> > check(t, vector<int>(p, 0));
        vector<input > data(r);
        rep(i, t) {
            team[i].second.second = i+1;
            team[i].first = 0;
            team[i].second.first = 0;
        }
        rep(i, r) {
            cin >> data[i].first >> data[i].second.first
                >> data[i].second.second.first 
                >> data[i].second.second.second;
            data[i].first;
            data[i].second.first--;
            data[i].second.second.first--;
            data[i].second.second.second;
        }
        sort(data.begin(), data.end());
        rep(i, r) {
            int a = data[i].first, b = data[i].second.first, 
                c = data[i].second.second.first, 
                d = data[i].second.second.second;
            if (d) {
                if (check[b][c] != -1) {
                    check[b][c]++;
                }
            } else {
                if (check[b][c] != -1) {
                    team[b].first++;
                    team[b].second.first 
                        -= data[i].first + check[b][c] * 20;
                    check[b][c] = -1;
                }
            }
        }
        sort(team.begin(), team.end(), greater<Team>());
        cout << team[0].second.second;
        for (int i = 1; i < t; i++) {
            if (team[i].first == team[i-1].first && 
                    team[i].second.first == team[i-1].second.first) {
                cout << "=" << team[i].second.second;
            } else {
                cout << "," << team[i].second.second;
            }
        }
        cout << endl;
    }

    return 0;
}

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

int main() {
  for(int M, T, P, R; cin >> M >> T >> P >> R && (M|T|P|R);) {
    vector<int> ac(T, 0), ti(T, 0);
    set<pair<int,int> > vis;
    for(int i = 0; i < R; ++i) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      if(!j && !vis.count(make_pair(t,p))) {
        vis.insert(make_pair(t,p));
        ++ac[t-1];
        ti[t-1] += m;
      }
    }
    vector<vector<int> > v;
    for(int i = 0; i < T; ++i) {
      vector<int> u(3);
      u[0] = ac[i];
      u[1] = -ti[i];
      u[2] = i+1;
      v.push_back(u);
    }
    sort(v.begin(), v.end(), greater<vector<int> >());
    for(int i = 0; i < v.size(); ++i) {
      if(i) {
        cout << (v[i-1][0] == v[i][0] && v[i-1][1] == v[i][1] ? '=' : ',');
      }
      cout << v[i][2];
    }
    cout << endl;
  }
  return 0;
}

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

#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define all(co) begin(co), end(co)

int main() {
	int m,t,p,r;
while (cin >> m >> t >> p >> r && m) {
	vector<vector<int>> v(t, vector<int>(p));
	rep(i, r) {
		int m, t, p, j; cin >> m >> t >> p >> j;
		t--;
		if (j == 0) {
			if(v[t][p] == 0) v[t][p] = m;
			else v[t][p] = m + -v[t][p] * 20;
		}
		else v[t][p]--;
	}
	map<int, vector<int>> rank;
	rep(i, t) {
		int s = -accumulate(all(v[i]), 0);
		if(rank.count(s)) rank.push_back(i + 1);
		else rank.insert(s, vector<int>{i+1});
	}
	for(auto it = rank.begin(); it != --rank.end(); it++) {
		rep(i, it->size() - 1) cout << it->at(i) << '=';
		cout << it->back();
		cout << ',';
	}
	{
		auto it = --rank.end();
		rep(i, it->size() - 1) cout << it->at(i) << '=';
		cout << it->back();
	}
	cout << endl;
}