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;

int main() {
  int m,t,p,r;
  while(cin >> m >> t >> p >> r && m) {
    int score[t+1],penalty[t+1][p+1],clear[p+1],term[t+1];
    for(int i=1; i<=t; i++) {
      score[i]=0;
      for(int j=1; j<=p; j++) penalty[i][j]=clear[j]=0;
      term[i]=i;
    }
    for(int i=0; i<r; i++) {
      int a,b,c,d;
      cin >> a >> b >> c >> d;
      if(!d) score[b]+=penalty[b][c]*20+a-100000;
      else penalty[b][c]++;
    }

    for(int i=1; i<=t; i++) {
      for(int j=i; j>1; j--) {
	if(score[j]<score[j-1]) {
	  swap(score[j],score[j-1]);
	  swap(term[j],term[j-1]);
	} else if(score[j]==score[j-1]) {
	  if(term[j]>term[j-1]) swap(term[j],term[j-1]);
	}
      }
    }
    for(int i=1; i<=t; i++) {
      if(i>1) {
	if(score[i-1]==score[i]) cout << "=";
	else cout << ",";
      }
      cout << term[i];
    }
    cout << endl;
  }
  return 0;
}

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

const int INF=5000000;

int data[51][12];

int main(){
	int M,T,P,R;
	while(cin>>M>>T>>P>>R && M){
		fill((int*)data,(int*)(data+12),0);
		for(int i=0;i<R;i++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			if(j==0){
				data[t][0]++;
				data[t][11]+=m+data[t][p]*20;
			}
			else data[t][p]++;
		}
		int prev[2]={INF,0};
		for(int i=0;i<T;i++){
			int ans=0;
			int now[2]={0,INF};
			for(int j=T;j>=0;j--){
				if(data[j][0]>now[0]){
					now[0]=data[j][0];
					now[1]=data[j][11];
					ans=j;
				}
				else if(data[j][0]==now[0] && data[j][11]<now[1]){
					now[1]=data[j][11];
					ans=j;
				}
			}
			if(i){
				if(memcmp(now,prev,sizeof(now))==0)cout<<"=";
				else cout<<",";
			}
			cout<<ans;
			memcpy(prev,now,sizeof(now));
			data[ans][0]=-1;
		}
		cout<<endl;
	}
}

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

typedef pair<int, int> Pii;

int main() {
  int M, T, P, R;
  while ( cin >> M >> T >> P >> R, M ) {
    vector<int> cnt(T, 0);
    vector<vector<int> > solved(T, vector<int>(P, 0));    
    vector<int> times(T, M+1);
    vector<vector<int> > pena(T, vector<int>(P, 0));    
    while ( R-- ) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      t--; p--;
      if ( !j ) {
	if ( solved[t][p] ) continue;
	solved[t][p] = 1;
	times[t] += m;
	times[t] += pena[t][p]*20;	
	cnt[t]++;	
      } else if ( !solved[t][p] ) {
	pena[t][p]++;
      }
    }

    vector<Pii> ps[P+1];    
    for ( int i = 0; i < T; i++ ) {
      ps[cnt[i]].push_back(Pii(times[i], -i));      
    }

    int cnt_t = 0;
    for ( int i = P; i >= 0; i-- ) {
      if ( !ps[i].size() ) continue;
      sort(ps[i].begin(), ps[i].end());
      for ( int j = 0; j < (int)ps[i].size(); j++ ) {
	if ( !cnt_t ) cout << -ps[i][j].second+1;
	else if ( j && ps[i][j].first == ps[i][j-1].first ) {
	  cout << '=' << -ps[i][j].second+1;
	} else {
	  cout << "," << -ps[i][j].second+1;	  
	}
	cnt_t++;
      }
    }
    
    cout << endl;
  }

  return 0;
}

C++: #include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

#define cn first
#define pn second.first
#define tn second.second

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;

int main(void){
    for(int m, t, p, r; cin >> m >> t >> p >> r, t;){
        vector<vi> wc = vector<vi>(t, vi(p, 0));

        vector< pair<int, pii> > res(t);
        rep(i, t) res[i].tn = (-1) * i;

        rep(i, r){
            int tid, pid, tm, msg; cin >> tm >> tid >> pid >> msg;
            tid--, pid--;

            if(msg == 0){
                res[tid].cn--;
                res[tid].pn += wc[tid][pid] * 20 + tm;
            }
            else{
                wc[tid][pid]++;
            }
        }

        sort(all(res));
        cout << res[0].tn * (-1) + 1;
        range(i, 1, t){
            if(res[i - 1].cn == res[i].cn &&
               res[i - 1].pn == res[i].pn){
                cout << "=";
            }
            else cout << ",";
            cout << res[i].tn * (-1) + 1;
        }
        cout << endl;
    }

	return 0;
}