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 FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)

#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))

typedef long long ll;
typedef pair<int, int> PII;

const double EPS = 1e-10;

const int M = 300;
const int T = 50;
const int P = 10;
const int R = 2000;
int m, t, p, r;

typedef struct team_def {
  int idx;  //index of the team
  int tac;  //total number of AC
  int tt;   //total time with penalty
  team_def() {idx = tac = tt = 0;}
  team_def(int _idx, int _tac, int _tt) {
    idx = _idx;
    tac = _tac;
    tt  = _tt;
  }
} team;

int my_compare(const void *pl, const void *pr) {
  team *tl = (team *)pl;
  team *tr = (team *)pr;
  
  //AC number...descending order
  if (tl->tac < tr->tac)
    return 1;
  else if (tl->tac > tr->tac)
    return -1;

  //penalty time...ascending order
  if (tl->tt < tr->tt)
    return -1;
  else if (tl->tt > tr->tt)
    return 1;

  //team index...descending order
  if (tl->idx < tr->idx)
    return 1;
  else if (tl->idx > tr->idx)
    return -1;

  return 0;
}

int ac[T][P]; //1:AC, 0:not AC
int wa[T][P]; //time with penalty
team tms[T];

int main() {
  int i, j;

  while (1) {
    memset(ac, 0, sizeof(ac));
    memset(wa, 0, sizeof(wa));
    scanf("%d%d%d%d ", &m, &t, &p, &r);
    if (!m && !p && !t && !r) break;
    for (i=0; i<r; i++) {
      int mm, tt, pp, rr;
      scanf("%d%d%d%d ", &mm, &tt, &pp, &rr);
      tt--; pp--;
      if (!rr) {
        ac[tt][pp] = 1; 
        wa[tt][pp] += mm;
      } else
        wa[tt][pp] += 20;
    }

    for (i=0; i<t; i++) {
      tms[i].idx = i; 
      tms[i].tac = tms[i].tt = 0;
    }
    for (i=0; i<t; i++)
      for (j=0; j<p; j++) {
        if (ac[i][j]) {
          tms[i].tac++;
          tms[i].tt += wa[i][j];
        }
      }

    qsort(tms, t, sizeof(team), my_compare);

    printf("%d", tms[0].idx + 1);
    for (i=1; i<t; i++) {
      if (tms[i].tac == tms[i-1].tac && tms[i].tt == tms[i-1].tt)
        printf("=");
      else
        printf(",");
      printf("%d", tms[i].idx + 1);
    }
    printf("\n");
  }

  return 0;
}

C++: #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;

struct Team{
  int team_id=-1;
  int wa_count[11]={};
  int ac_time=9999;
  int penalty_time=9999;
  int result_time=999999;
  int ac_count=-1;
  bool operator==(const Team& another)const{
    return ac_count==another.ac_count&&result_time==another.result_time;
  }
};

bool Comp(const Team& a,const Team& b){
  if(a.ac_count!=b.ac_count){
    return a.ac_count>b.ac_count;
  }else if(a.result_time!=b.result_time){
    return a.result_time<b.result_time;
  }else{
    return a.team_id>b.team_id;
  }
}


void Solve(int m,int t,int p,int r){
  std::vector<Team> team(t+1);

  for(int i=1;i<=t;i++){
    team[i].team_id=i;
    team[i].ac_time=0;
    team[i].penalty_time=0;
    team[i].result_time=0;
    team[i].ac_count=0;
  }
  for(int i=0;i<r;i++){
    int mk,tk,pk,jk;
    cin>>mk>>tk>>pk>>jk;
    Team& tgt=team[tk];
    if(jk==0){
      //AC
      tgt.ac_time+=mk;
      tgt.penalty_time+=tgt.wa_count[pk]*20;
      tgt.ac_count++;
    }else{
      //WA
      tgt.wa_count[pk]++;
    }
  }

  for(int i=1;i<=t;i++){
    team[i].result_time=team[i].penalty_time+team[i].ac_time;
  }

  std::sort(team.begin(),team.end(),Comp);

  for(int i=0;i<t-1;i++){
    if(team[i]==team[i+1]){
      cout<<team[i].team_id<<"=";
    }else{
      cout<<team[i].team_id<<",";
    }
  }
  cout<<team[t-1].team_id<<endl;


}



int main(void) {
  cout << std::fixed << std::setprecision(10);
  cin.tie(0);
  std::ios::sync_with_stdio(false);


  while(true){
    int m,t,p,r;
    cin>>m>>t>>p>>r;
    if(m==0&&t==0&&p==0&&r==0){
      break;
    }
    Solve(m,t,p,r);

  }




  return 0;
}