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 rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define all(co) begin(co), end(co)

int main() {
	int m,t,p,r;
while (cin >> m >> t >> p >> r && m) {
	vector<vector<int>> v(t, vector<int>(p));
	rep(i, r) {
		int m, t, p, j; cin >> m >> t >> p >> j;
		t--;
		if (j == 0) {
			if(v[t][p] == 0) v[t][p] = m;
			else v[t][p] = m + -v[t][p] * 20;
		}
		else v[t][p]--;
	}
	map<int, vector<int>> rank;
	rep(i, t) {
		int s = -accumulate(all(v[i]), 0);
		if(rank.count(s)) rank[s].push_back(i + 1);
		else rank.insert(s, vector<int>{i+1});
	}
	for(auto it = rank.begin(); it != --rank.end(); it++) {
		rep(i, it->size() - 1) cout << it->at(i) << '=';
		cout << it->back();
		cout << ',';
	}
	{
		auto it = --rank.end();
		rep(i, it->size() - 1) cout << it->at(i) << '=';
		cout << it->back();
	}
	cout << endl;
}

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;
  
  if (tl->tac < tr->tac)
    return 1;
  else if (tl->tac > tr->tac)
    return -1;

  if (tl->tt < tr->tt)
    return -1;
  else if (tl->tt > tr->tt)
    return 1;

  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 <bits/stdc++.h>

using namespace std;

#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define RREP(i, n) for(int i = (int)(n - 1); i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SQ(n) (n) * (n)

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vc> vvc;
typedef vector<vll> vvll;

struct Team {
  int correct;
  int penalty;
  int vpenalty[10];
  int id;

  bool operator <(const Team& p) const {
    if (correct == p.correct)
      if (penalty == p.penalty)
        return id < p.id;
      else
        return penalty > p.penalty;
    else
      return correct < p.correct;
  }

  bool operator ==(const Team& p) const {
    if (correct == p.correct)
      return penalty == p.penalty;
    else
      return correct == p.correct;
  }
};

int main() {
  int M, T, P, R;
  while(cin >> M >> T >> P >> R) {
    vector<Team> team(T);
    REP(i, T){
      team[i].id = i + 1;
    }

    REP(i, R){
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      t--; p--;

      if (j) {
        team[t].vpenalty[p] += 20;
      }else{
        team[t].correct++;
        team[t].penalty += m + team[t].vpenalty[p];
      }
    }
    RSORT(team);
    cout << team[0].id;
    FOR(i, 1, T){
      if (team[i - 1] == team[i]) cout << '=';
      else cout << ',';
      cout << team[i].id;
    }
    cout << endl;
  }
}