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<vector>
#include<algorithm>
using namespace std;
void swapp(int *,int *);
int main(){
  while(1){
    int M,T,P,R;
    cin >> M >> T >> P >> R;
    if(M==0&&T==0&&P==0&&R==0)break;
    int te[51];
    int tr[51];
    int tp[51]={};
    int tt[51]={};
    vector<vector<int> >ts(T+1,vector<int>(P,0));
    for(int i=0;i<R;i++){
      int m,t,p,j;
      cin >> m >> t >> p >> j;
      if(j==0){
	tt[t]+=ts[t][p]+m;
	tp[t]++;
      }
      else{
	ts[t][p]+=20;
      }
    }
    for(int i=1;i<=T;i++){
      //
      // cout << i<<" "<<tp[i]<< " "<< tt[i]<<endl;
      //
      tr[i]=i;
      te[i]=0;
    }
    //sort
    for(int i=1;i<=T;i++){
      for(int j=1;j<T;j++){
	if(tp[j]<tp[j+1]){
	  //  cout << tr[j]<<" "<<tr[j+1]<<endl;
	  swapp(tr+j,tr+j+1);
	  swapp(te+j,te+j+1);
	  swapp(tt+j,tt+j+1);
	  swapp(tp+j,tp+j+1);
	  //  cout << tr[j]<<" "<<tr[j+1]<<endl;
	}
	else if(tp[j]==tp[j+1]){
	  if(tt[j]>tt[j+1]){
	    swapp(tr+j,tr+j+1);
	    swapp(te+j,te+j+1);
	    swapp(tt+j,tt+j+1);
	    swapp(tp+j,tp+j+1);
	  }
	  else if(tt[j]==tt[j+1]){
	    if(tr[j]<tr[j+1]){
	      swapp(tr+j,tr+j+1);
	      swapp(te+j,te+j+1);
	      swapp(tt+j,tt+j+1);
	      swapp(tp+j,tp+j+1);
	    }
	    te[j]=1;
	    
	  }
	}
      }
    }
    // for(int i=1;i<=T;i++)  cout << i<<" "<<tp[i]<< " "<< tt[i]<<endl;
    for(int i=1;i<=T;i++){

      cout << tr[i];
      if(i<T){
	if(te[i]==1){
	  cout << '=';
	}
	else cout << ',';
      }
    }
    cout << endl;
  }
  return 0;
}
void swapp(int *m,int *a){
  int b;
  b=*m;
  *m=*a;
  *a=b;
  return;
}

C++: #include<iostream>
#include<string>
#include<vector>
#include<tuple>
#include<set>
#include<map>
#include<algorithm>
using namespace std;

struct Record {
  int tid, pid, time;
  bool correct;
};

struct Team {
  Team() {
    penalty = 0;
  }
  set<int> solved;
  map<int, int> WA;
  int penalty;
};

// Solved Problems, Penalty, Team ID
typedef tuple<int, int, int> Score;

int main() {
  int M, T, P, R;
  while (cin >> M >> T >> P >> R && M) {
    vector<Record> records(R);
    for (int i = 0; i < R; i++) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      records[i].pid = --p;
      records[i].tid = --t;
      records[i].time = m;
      records[i].correct = (j == 0);
    }

    vector<Team> teams(T);
    for (Record r : records) {
      if (teams[r.tid].solved.find(r.pid) != teams[r.tid].solved.end()) {
        continue;
      } else if (r.correct) {
        teams[r.tid].solved.insert(r.pid);
        teams[r.tid].penalty +=
          teams[r.tid].WA[r.pid] * 20 + r.time;
      } else {
        teams[r.tid].WA[r.pid]++;
      }
    }

    vector<Score> team_result(T);
    for (int i = 0; i < T; i++) {
      get<0>(team_result[i]) = -teams[i].solved.size();
      get<1>(team_result[i]) = teams[i].penalty;
      get<2>(team_result[i]) = -i;
    }

    sort(team_result.begin(), team_result.end());

    for (int i = 0, len = team_result.size(); i < len; i++) {
      Score s = team_result[i];
      if (i > 0) {
        Score p = team_result[i - 1];
        cout << 
          (get<0>(p) == get<0>(s) && get<1>(p) == get<1>(s)?"=":",");
      }
      cout << -get<2>(s)+1;
    }
    cout << endl;
  }
}

C++: // {{{ include
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
// }}}
#include <tuple>

using namespace std;

typedef long long ll;
inline int in(){int x;scanf("%d",&x);return x;}

struct Team {
  int accept;
  int penalty;
  int id;
  Team(int id) : id(id), accept(0), penalty(0) {}
  bool operator<(const Team& rhs) const {
    return make_tuple(-accept, penalty, -id) < make_tuple(-rhs.accept, rhs.penalty, -rhs.id);
  }
  bool operator==(const Team& rhs) const {
    return accept == rhs.accept && penalty == rhs.penalty;
  }
};

int main()
{
  int M, T, P, R;
  while (M = in(), T = in(), P = in(), R = in(), M || T || P || R){
    vector<vector<int>> wa(T, vector<int>(P, 0));

    vector<Team> teams;
    teams.reserve(T);
    for (int i = 0; i < T; i++){
      teams.emplace_back(i + 1);
    }
    for (int i = 0; i < R; i++){
      int m = in(), t = in() - 1, p = in() - 1, j = in();
      if (j != 0) wa[t][p]++;
      else teams[t].penalty += wa[t][p] * 20 + m, teams[t].accept++;
    }
    sort(begin(teams), end(teams));
    auto prev = teams[0];
    for (int i = 0; i < T; i++){
      if (i != 0) putchar(",="[prev == teams[i]]);
      printf("%d", teams[i].id);
      prev = teams[i];
    }
    puts("");
  }
  return 0;
}