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 <bits/stdc++.h>
using namespace std;
#define REP(i,b,e) for(int i=(b);i<(e);++i)
#define rep(i,e) for(int i=0;i<(e);++i)

int main() {
  int M, T, P, R;
  while(cin >> M >> T >> P >> R){
    if(M==0) return 0;
    int solved[T][P] = {};
    vector<vector<int>> team(T, vector<int>(3)); // 0:solved, 1:time, 2:team number
    rep(i, T) team[i][2] = -i-1;
    rep(i, R){
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      t--;p--;
      if(j==0){
        if(solved[t][p]<0) team[t][1] += m + 20*abs(solved[t][p]);
        else{
          team[t][1] += m;
        }
        team[t][0] -= 1;
      }
      else solved[t][p] -= 1;
    }
    sort(team.begin(), team.end());
    rep(i, T){
      cout<<-team[i][2];
      if(i!=T-1){
        if(team[i][0]==team[i+1][0] && team[i][1]==team[i+1][1]) cout << "=";
        else cout<<",";
      }
    }
    cout<<endl;
  }
  return 0;
}

C++: #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int M,T,P,R;
struct team
{
	int id,ac,miss;
	team(int id,int ac,int miss):id(id),ac(ac),miss(miss){}
	bool operator <(const team &T)const{
		if(ac!=T.ac)return ac >T.ac;
		if(miss!=T.miss)return miss >T.miss;
		return id >T.id;
	}
	bool operator ==(const team &T)const{
		return (ac==T.ac&&miss ==T.miss);
	}
};
int main(){
	while(cin>>M>>T>>P>>R,M||T||P||R){
		vector<team> data;
		int failed[400][20]={{0}};
		rep(i, T)data.push_back(team(i+1,0,0));
		rep(i,R){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			t--;
			if(j==0){
				data[t].ac++;
				data[t].miss+=(m+failed[t][p]);
			}else{
				failed[t][p]+=20;
			}
		}
		sort(all(data));
		rep(i, T){
			cout <<data[i].id;
			if(i==T-1){
				cout <<endl;
			}else{
				cout <<((data[i]==data[i+1])?"=": ",");
			}
		}
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
  int M, T, P, R, m, t, p, j;
  while (cin >> M >> T >> P >> R, M) {
    vector< vector<int> > V(T, vector<int>(P, 0)), Result(T, vector<int>(3, 0));
    for (int i = 0; i < T; ++i) Result[i][2] = -i-1;
    for (int i = 0; i < R; ++i) {
      cin >> m >> t >> p >> j;
      if (j) ++V[t-1][p-1];
      else {
	--Result[t-1][0];
	Result[t-1][1] += V[t-1][p-1]*20+m;
      }
    }
    sort(Result.begin(), Result.end());
    cout << -Result[0][2];
    for (int i = 1; i < T; ++i) {
      if (Result[i-1][0] == Result[i][0] && Result[i-1][1] == Result[i][1]) cout << "=";
      else cout << ",";
      cout << -Result[i][2];
    }
    cout << endl;
  }
  return 0;
}

C++: #include <vector>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functional>

using namespace std;

int main()
{
	while (true)
	{
		int M, T, P, R;

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

		if (M == 0 && T == 0 && P == 0 && R == 0) { break; }

		vector<vector<int> > time(T, vector<int>(P, 0));
		vector<vector<bool> > cor(T, vector<bool>(P, false));

		vector<int> score(T, 0);
		vector<int> rank(T, 0);

		for (int i = 0; i < R; i++) 
		{ 
			int m, t, p, j;

			cin >> m >> t >> p >> j;

			if (j == 0)
			{
				time[t - 1][p - 1] += m;

				cor[t - 1][p - 1] = true;
			}
			else
			{
				time[t - 1][p - 1] += 20;
			}
		}

		for (int i = 0; i < T; i++)
		{
			for (int j = 0; j < P; j++)
			{
				if (cor[i][j] == true)
				{ 
					score[i] += 100000; 

					score[i] -= time[i][j];
				}
			}
		}

		for (int i = 0; i < T; i++) { rank[i] = i + 1; }

		for (int i = 0; i < T; i++)
		{
			for (int j = i + 1; j < T; j++)
			{
				if (score[i] < score[j])
				{
					swap(score[i], score[j]);

					swap(rank[i], rank[j]);
				}
				else if (score[i] == score[j] && rank[i] < rank[j])
				{
					swap(rank[i], rank[j]);
				}
			}
		}

		for (int i = 0; i < T; i++)
		{
			if (i + 2 == T)
			{
				cout << rank[i] << endl;
			}
			else if (score[i] == score[i + 1])
			{
				cout << rank[i] << '=';
			}
			else
			{
				cout << rank[i] << ',';
			}
		}
	}

	return 0;
}