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;

typedef pair<pair<int, int>, int> P;
bool comp(P hl, P hr){
	if(hl.first.first != hr.first.first) return hl.first.first > hr.first.first;
	if(hl.first.second != hr.first.second) return hl.first.second < hr.first.second;
	return hl.second > hr.second;
}

int main(){
while(1){//start

	//init
	int pm[51];
	int solved[51];
	int wa[51][11];
	for(int i = 0; i < 51; i++){
		pm[i] = 0;
		solved[i] = 0;
		for(int j = 0; j < 11; j++) wa[i][j] = 0;
	}


	int M, T, P, R;
	cin >> M >> T >> P >> R;
	if(M == 0 and T == 0 and P == 0 and R == 0) break;

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

		//ac
		if(j == 0){
			solved[t]++;
			pm[t] += m + wa[t][p] * 20;
		}
		//wa
		else wa[t][p]++;
	}

	vector<pair<pair<int, int>, int> > v;
	for(int i = 1; i <= T; i++){
		v.push_back(make_pair(make_pair(solved[i], pm[i]), i));
	}

	sort(v.begin(), v.end(), comp);


	//debug
	//for(int i = 0; i < (int)v.size(); i++) cout << v[i].first.first << " " << v[i].first.second << " " << v[i].second << endl;

	int tm = v[0].first.second;
	int sol = v[0].first.first;
	cout << v[0].second;
	for(int i = 1; i < (int)v.size(); i++){
		if(sol == v[i].first.first and tm == v[i].first.second) cout << "=";
		else cout << ",";
		cout << v[i].second;
		sol = v[i].first.first;
		tm = v[i].first.second;
	}
	cout << endl;

}//end
	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <memory>
#include <cstring>
#include <cassert>
#include <numeric>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cctype>
#include <unordered_map>
#include <unordered_set>
using namespace std;

#define REP2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define REP(i, n) REP2(i, 0, n)
#define ALL(S) (S).begin(), (S).end()
typedef long long ll;

int main(){
  ios::sync_with_stdio(false);
  int M, T, P, R;
  while (cin >> M >> T >> P >> R && M + T + P + R > 0){
    vector<int> sum(T);
    vector<int> num(T);
    vector<vector<int> > wa(T, vector<int>(P));
    REP(i, R){
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      t--, p--;
      if (j == 0){
        num[t]++;
        sum[t] += wa[t][p] * 20;
      } else {
        wa[t][p]++;
      }
    }
    vector<tuple<int, int, int> > vp;
    REP(i, T){
      vp.push_back(make_tuple(-num[i], sum[i], -i));
    }
    sort(ALL(vp));

    REP(i, T){
      if (i > 0){
        if (get<0>(vp[i]) == get<0>(vp[i - 1]) && get<1>(vp[i]) == get<1>(vp[i - 1])){
          cout << "=";
        } else {
          cout << ",";
        }
      } 
      cout << - get<2>(vp[i]) + 1;
    }
    cout << endl;
  }
  return 0;
}

C++: #include <stdio.h>

typedef struct{
  int team;
  int ans[10];
  int time[10];
  int anum;
  int tnum;
}data_t;

void InsSort(data_t data[], int n){
  data_t temp;
  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j].team>data[j-1].team ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j-1] = temp;
    }
  }

  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j].tnum<data[j-1].tnum ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j-1] = temp;
    }
  }
  
  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j].anum>data[j-1].anum ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j-1] = temp;
    }
  }
}

int main(void){
  int M, T, P, R;
  int m, t, p, j;
  data_t data[50];
  while(1){
    scanf("%d%d%d%d", &M, &T, &P, &R);
    if(M==0 && T==0 && P==0 && R==0){
      break;
    }

    for(int i=0; i<T; i++){
      data[i].team = i+1;
      data[i].anum = 0;
      data[i].tnum = 0;
      for(int j=0; j<10; j++){
	data[i].ans[j] = 1;
	data[i].time[j] = 0;
      }
    }

    for(int i=0; i<R; i++){
      scanf("%d%d%d%d", &m, &t, &p, &j);
      if(j == 0){
	data[t-1].ans[p-1] = 0;
	data[t-1].time[p-1] += m;
      }else if(j == 1){
	data[t-1].time[p-1] += 20;
      }
    }
    for(int i=0; i<T; i++){
      for(int j=0; j<P; j++){
	if(data[i].ans[j] == 0){
	  data[i].anum++;
	  data[i].tnum += data[i].time[j];
	}
      }
    }
    InsSort(data, T);

    printf("%d", data[0].team);
    for(int i=1; i<T; i++){
      if(data[i].anum==data[i-1].anum && data[i].tnum==data[i-1].tnum){
	printf("=");
      }else{
	printf(",");
      }
      printf("%d", data[i].team);
    }
    printf("\n");
  }
  return 0;
}