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 <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <complex>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010

bool solve(){
  int M,T,P,R;
  int score[50] = {}, penalty[50] = {};
  int subc[50][15] = {};
  
  scanf("%d%d%d%d",&M,&T,&P,&R);
  if(M == 0) return false;

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

    scanf("%d%d%d%d",&m,&t,&p,&j);
    t--;
    
    if(j == 0){ //AC
      score[t] ++;
      penalty[t] += subc[t][p] * 20 + m;
    }else{
      subc[t][p]++;
    }
  }

  vector<pair<pair<int,int>, int > > standings;
  
  for(int i=0;i<T;i++){
    standings.push_back({{score[i], -penalty[i]},i+1});
  }

  sort(standings.begin(), standings.end(),greater<pair<pair<int,int>,int > >());

  for(int i=0;i<T;i++){
    printf("%d",standings[i].second);
    
    if(i < T-1){
      if(standings[i].first == standings[i+1].first){
        printf("=");
      }else{
        printf(",");
      }
    }else{
      printf("\n");
    }
    
  }

  return true;
}

int main(){

  while(solve());
  
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define rep(i,x,y) for(int (i)=(x);(i)<(y);(i)++)

typedef struct{
  int teamid;
  int seikai;
  int time;
  int fuseikai[10];
}Team;

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<Team> team(T);
    rep(i,0,T){
      team[i].teamid=i;
      team[i].seikai=0;
      team[i].time=0;
      rep(j,0,10){
        team[i].fuseikai[j]=0;
      }
    }

    rep(i,0,R){
      int m,t,p,j;
      cin>>m>>t>>p>>j;

      if(j==0){
        team[t-1].seikai++;
        team[t-1].time+=m;
        if(team[t-1].fuseikai[p-1]!=0){
          team[t-1].time+=team[t-1].fuseikai[p-1]*20;
        }
      }else{
        team[t-1].fuseikai[p-1]++;
      }
    }

    for(int i=team.size()-1;i>=0;i--){
      for(int j=0;j<i;j++){
        if(team[j+1].seikai>team[j].seikai){
          swap(team[j],team[j+1]);
        }else if(team[j].seikai==team[j+1].seikai){
          if(team[j+1].time<team[j].time){
            swap(team[j],team[j+1]);
          }else if(team[j+1].time==team[j].time){
            if(team[j].teamid<team[j+1].teamid){
              swap(team[j],team[j+1]);
            }
          }
        }
      }
    }

    rep(i,0,T){
      cout<<team[i].teamid+1;
      if(i!=T-1){
        if(team[i+1].seikai==team[i].seikai&&team[i+1].time==team[i].time){
          cout<<"=";
        }
        else{
          cout<<",";
        }
      }
    }
    cout<<endl;
  }

  return 0;
}