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 <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
typedef pair<ll, int> pll;

int main()
{
  int M,T,P,R;
  while(cin>>M>>T>>P>>R,M||T||P||R) {
    int A[T+1],times[T+1],pena[T+1],miss[T+1][P+1];
    CLR(A);CLR(times);CLR(pena);CLR(miss);
    FOR(i,0,R) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      if(j==0) {
        A[t]++;
        times[t] += m;
        pena[t] += miss[t][p] * 20;
      } else {
        miss[t][p]++;
      }
    }
    vector<pll> score(T);
    FOR(i,1,T+1) {
      ll s = A[i] * 1000000 - pena[i] - times[i];
      score[i-1] = pll(s, i);
    }
    sort(score.rbegin(), score.rend());
    int j = 1;
    ll now = score[0].first;
    vector<vector<int> > ans(T+1);
    FOR(i,0,T) {
      if(now > score[i].first) {
        j++;
        now = score[i].first;
      }
      ans[j].push_back(score[i].second);
    }
    FOR(i,1,T+1) {
      if((int)ans[i].size() > 0) {
        if(i!=1) cout << ',';
        vector<int> pr;
        FOR(j,0,(int)ans[i].size()) {
          pr.push_back(ans[i][j]);
        }
        sort(pr.rbegin(), pr.rend());
        FOR(j,0,(int)pr.size()) {
          if(j!=0) cout<<'=';
          cout << pr[j];
        }
      }
    }
    cout << '\n';
  }
  return 0;
}

C++: #include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

struct S
{
    int id;
    int ac, time, rank;
    int check[11], wa[11];
    S(){
        ac = time = rank = 0;
        rep(i, 11) check[i] = wa[i] = 0;
    }
    bool operator < (const S& s) const {
        if(ac != s.ac) return ac > s.ac;
        if(time != s.time) return time < s.time;
        return id > s.id;
    }
    bool operator > (const S& s) const{
        return s < *this;
    }
    bool operator == (const S& s) const{
        return (!(*this < s)) && (!(s < *this));
    }
    bool operator != (const S& s) const {
        return !(*this == s);
    }
    void add(int prob, int judge, int t) {
        if(check[prob] != 0) return;
        if(judge == 0) {
            ac++;
            check[prob]=1;
            time += t + wa[prob] * 20;
        }
        else {
            wa[prob]++;
        }
    }
};

int main(){
    int m, t, p, r;
    while(cin >> m >> t >> p >> r) {
        if(m == 0 && t == 0 && p == 0 && r == 0) break;
        vector<S> s(t);
        rep(i, t) s[i].id = i+1;
        rep(i, r) {
            int a, b, c, d;
            cin >> a >> b >> c >> d;
            b--;
            s[b].add(c, d, a);
        }
        sort(all(s));
        cout << s[0].id;
        REP(i, 1, t) {
            if(s[i].ac == s[i-1].ac && s[i].time == s[i-1].time) cout << "=";
            else cout << ",";
            cout << s[i].id;
        }
        cout << endl;
        // rep(i, t) {
        //     cout << s[i].id << " " << s[i].ac << " " << s[i].time << endl;
        // }
    }

    return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
	int solved[50];
	int time[50][10];
	int team[50];
	int m,t,p,r;
	while(true){
	cin>>m>>t>>p>>r;
	if(m==0&&t==0&&p==0&&r==0)
		break;
	for(int i=0;i<t;i++){
		solved[i]=0;
		for(int j=0;j<p;j++)
			time[i][j]=0;
		team[i]=i+1;
	}
	for(int i=0;i<r;i++){
		int a[4];
		for(int j=0;j<4;j++)
			cin>>a[j];
		if(a[3]==0)
			solved[a[1]-1]+=1000-time[a[1]-1][a[2]-1]-a[0];
		else
			time[a[1]-1][a[2]-1]+=20;
	}
	for(int i=0;i<t-1;i++){
		for(int j=t-1;j>i;j--){
			if(solved[j]>solved[j-1]||(solved[j]==solved[j-1]&&team[j]>team[j-1])){
				int tmp=solved[j];
				solved[j]=solved[j-1];
				solved[j-1]=tmp;
				tmp=team[j];
				team[j]=team[j-1];
				team[j-1]=tmp;
			}
		}
	}
	cout<<team[0];
	for(int i=1;i<t;i++){
		if(solved[i]==solved[i-1])
			cout<<"=";
		else
			cout<<",";
		cout<<team[i];
	}
	cout<<endl;
	}
	return 0;
}