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 <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

void solve(int M, int T, int P, int R) {
    vector<pair<VI, VI>> team(T);
    REP(i, T) team[i] = MP(VI(P, -1), VI(P, 0)); //(AC?????????, WA??°)
    REP(i, R) {
        int m, t, p, j;
        cin >> m >> t >> p >> j;
        t--;p--;
        if (j == 0) {
            int pena = team[t].second[p] * 20;
            team[t].first[p] = pena + m;
        } else {
            team[t].second[p]++;
        }
    }
    vector<pair<PII, int>> ans(T); //(AC??°, ????¨??????????), ???????????????
    REP(i, T) {
        int ac = 0, tim = 0;
        REP(j, P) {
            if (team[i].first[j] != -1) {
                ac++;
                tim += team[i].first[j];
            }
        }
        ans[i] = MP(MP(ac, tim), i);
    }
    sort(ALL(ans), [](const pair<PII, int>& l, pair<PII, int>& r) {
        if (l.first.first != r.first.first) return l.first.first > r.first.first;
        if (l.first.second != r.first.second) return l.first.second < r.first.second;
        return l.second > r.second;
    });
    PII back = MP(-1, -1);
    REP(i, T) {
        if (i) if (ans[i].first == back) {
            cout << "=";
        } else {
            cout << ",";
        }
        cout << ans[i].second + 1;
        back = ans[i].first;
    }cout << endl;
    return;
}

signed main(void) {
    int n, m, p, a, b, c, x, y, z, q;
    string s;
    bool f = false;
    while (cin >> n >> m >> p >> a, n) {
        solve(n, m, p, a);
        //return 0;
    }
}

C++: #include<iostream>
#include<algorithm>

using namespace std;

#define rep(i, n) for (int i = 0; i < int(n); ++i)

struct Team {
  Team() {ac = pe = 0; rep (i, 10) p[i] = 0;}
  int ac, pe, num, p[10];
  bool operator<(Team t) const {
    if (ac != t.ac) return ac > t.ac;
    if (pe != t.pe) return pe < t.pe;
    return num > t.num;
  }
  bool operator==(Team t) {
    if (ac != t.ac) return false;
    if (pe != t.pe) return false;
    return true;
  }
};

int main() {
  while (true) {
    int M, T, P, R;
    cin >> M >> T >> P >> R;
    if (M == 0) break;
    Team team[T];
    rep (i, T) team[i].num = i + 1;
    rep (_, R) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      --t;
      --p;
      if (j == 0) {
	++team[t].ac;
	team[t].pe += team[t].p[p] * 20 + m;
      } else {
	++team[t].p[p];
      }
    }
    sort(team, team + T);
    rep (i, T) {
      if (i != 0) {
	cout << (team[i] == team[i -1] ? '=' : ',');
      }
      cout << team[i].num;
    }
    cout << endl;
  }
}

C++: #include <iostream>
#include <queue>
#include <tuple>
#include <map>
#include <set>

using namespace std;

#define rep(i,n) for(int i = 0; i < n; i++)

struct Team {
	int no, time;
	map<int, int> wa;
	set<int> ac;
	Team() : time(0) {}
	bool operator < (const Team &other) {
		if (ac.size() == other.ac.size()) {
			if (time == other.time) {
				return no < other.no;
			}
			return time > other.time;
		}
		return ac.size() < other.ac.size();
	}
	bool operator == (const Team &other) {
		return ac.size() == other.ac.size() && time == other.time;
	}
};

int main() {
	int M, T, P, R;
	while (cin >> M >> T >> P >> R && M) {
		vector<Team> teams(T);
		rep(i, T) {
			teams[i].no = i + 1;
		}
		rep(i, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			if (j == 0) {
				teams[t].time += teams[t].wa[p] * 20 + m;
				teams[t].ac.insert(p);
			}
			else {
				teams[t].wa[p]++;
			}
		}
		sort(teams.begin(), teams.end());
		reverse(teams.begin(), teams.end());
		rep(i, T-1) {
			cout << teams[i].no;
			if (teams[i] == teams[i + 1]) {
				cout << "=";
			}else{
				cout << ",";
			}
		}
		cout << teams.back().no << endl;
	}

	return 0;
}