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 int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);

class Team {
public:
	int id;
	int time = 0;
	vector<int> AC;
	vector<int> WA;
	Team(int P) {
		AC.resize(P, 0);
		WA.resize(P, 0);
	}
	bool operator<(const Team &t) {
		int cntAC1 = count(AC.begin(), AC.end(), 1);
		int cntAC2 = count(t.AC.begin(), t.AC.end(), 1);
		if (cntAC1 == cntAC2) {
			int t1 = time, t2 = t.time;
			rep(i, 0, AC.size())
				if (AC[i]) t1 += WA[i] * 20;
			rep(i, 0, t.AC.size())
				if (t.AC[i]) t2 += t.WA[i] * 20;
			if (t1 == t2)return id < t.id;
			else return t1 > t2;
		}
		else return cntAC1 < cntAC2;
	}
	bool operator==(const Team &t) {
		int cntAC1 = count(AC.begin(), AC.end(), 1);
		int cntAC2 = count(t.AC.begin(), t.AC.end(), 1);
		if (cntAC1 == cntAC2) {
			int t1 = time, t2 = t.time;
			rep(i, 0, AC.size())
				if (AC[i]) t1 += WA[i] * 20;
			rep(i, 0, t.AC.size())
				if (t.AC[i]) t2 += t.WA[i] * 20;
			return t1 == t2;
		}
		else return false;
	}
};

signed main() {
	for (int M, T, P, R; cin >> M >> T >> P >> R && (M || T || P || R);) {
		vector<Team> Teams(T, Team(P));
		rep(i, 0, T) { Teams[i].id = i + 1; }
		rep(i, 0, R) {
			int m, t, p, j; cin >> m >> t >> p >> j;
			t--;
			p--;
			if (j == 0) {
				Teams[t].AC[p] = 1;
				Teams[t].time += m;
			}
			else {
				Teams[t].WA[p]++;
			}
		}
		sort(Teams.begin(), Teams.end());
		reverse(Teams.begin(), Teams.end());
		cout << Teams[0].id;
		rep(i, 1, T) {
			cout << ",="[Teams[i] == Teams[i - 1]] << Teams[i].id;
		}
		cout << endl;
	}
	return 0;
}

C++: #include <algorithm>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <queue>
#include <set>
#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

using namespace std;

int main(){
  while(true){
    const int m = getInt();
    const int t = getInt();
    const int p = getInt();
    const int r = getInt();

    if(m + t + p + r == 0) break;

    vector<vector<int> > memo(t, vector<int>(p));
    vector<pair<int, pair<int, int> > > ans(t);

    REP(i,t) ans[i].second.second = i + 1;

    REP(i,r){
      const int mm = getInt();
      const int tt = getInt() - 1;
      const int pp = getInt() - 1;
      const int jj = getInt();

      if(jj == 0){
        ans[tt].first        += 1;
        ans[tt].second.first -= memo[tt][pp] * 20 + mm;
      }else{
        memo[tt][pp]++;
      }
    }

    sort(ans.rbegin(), ans.rend());

    REP(i,t){
      const pair<int, pair<int, int> > now = ans[i];
      if(i != 0){
        const pair<int, pair<int, int> > prev = ans[i - 1];
        if(now.first == prev.first && now.second.first == prev.second.first)
          printf("=");
        else
          printf(",");
      }
      printf("%d", now.second.second);
    }
    puts("");
  }

  return 0;
}

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

int main()
{
	int x, k, y, t;
	while (cin >> x >> k)
	{
		t = 1, y = 0;
		while (k)
		{
			if (x % 2 == 0)y += t*(k % 2), k /= 2;
			x /= 2, t *= 2;
		}
		cout << y << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

struct team {
  team(int p) : solved(p), penalty(p) {}
  vector<bool> solved;
  vector<int> penalty;
  int time, id;
  bool operator<(team const& t) const {
    int s1 = count(begin(solved), end(solved), true), s2 = count(begin(t.solved), end(t.solved), true);
    if(s1 == s2) {
      if(time == t.time) {
        return id > t.id;
      }
      return time < t.time;
    }
    return s1 > s2;
  }
  bool operator==(team const& t) const {
    int s1 = count(begin(solved), end(solved), true), s2 = count(begin(t.solved), end(t.solved), true);
    return s1 == s2 && time == t.time;
  }
};

int main() {
  int M, T, P, R;
  while(cin >> M >> T >> P >> R, M) {
    vector<team> ts(T, P);
    for(int i = 0; i < T; ++i) {
      ts[i].id = i + 1;
    }
    for(int i = 0; i < R; ++i) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      t--; p--;
      if(j == 0) { // solved
        if(!ts[t].solved[p]) {
          ts[t].time += m + ts[t].penalty[p];
        }
        ts[t].solved[p] = true;
      } else {
        ts[t].penalty[p] += 20;
      }
    }
    sort(begin(ts), end(ts));

    for(int i = 0; i < T; ++i) {
      cout << ts[i].id;
      if(i + 1 == T) {
        cout << endl;
      } else {
        if(ts[i] == ts[i + 1]) cout << "=";
        else cout << ",";
      }
    }
  }
}