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

int M, T, P, R;
int m, t, p, j;

int main() {
  while (scanf("%d%d%d%d", &M, &T, &P, &R) != EOF && M) {
    int ac[50][10];
    int wa[50][10];
    bool accepted[50][10];
    fill(&wa[0][0], &wa[0][0]+50*10, 0);	
    fill(&accepted[0][0], &accepted[0][0]+50*10, false);
    for (int i=0; i<R; i++) {
      scanf("%d%d%d%d", &m, &t, &p, &j);
      t--; p--;
      if (j == 0) {
	accepted[t][p] = true;
	ac[t][p] = m;
      } else {
	wa[t][p]++;
      }
    }
    tuple<int,int,int> ans[50];
    for (int i=0; i<T; i++) {
      int count = 0;
      int time = 0;
      for (int j=0; j<P; j++) {
	if (accepted[i][j]) {
	  count++;
	  time += wa[i][j] * 20 + ac[i][j];
	}
      }
      ans[i] = make_tuple(count, -time, i);
    }
    sort(ans, ans+T);
    reverse(ans, ans+T);
    for (int i=0; i<T; i++) {
      if (i != 0) {
	if (get<0>(ans[i-1]) == get<0>(ans[i]) 
	    && get<1>(ans[i-1]) == get<1>(ans[i])) {
	  printf("=");
	} else {
	  printf(",");
	}
      }
      printf("%d", get<2>(ans[i])+1);
    }
    printf("\n");
  }
}

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;
}