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>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define mpa make_pair
#define fi first
#define se second 
#define set20 cout<<fixed<<setprecision(20) ;
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
double pi=acos(-1) ;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}


int main(){

  while(1){
  int m,t,p,r ;cin>>m>>t>>p>>r ;
  if(m==0) break ;
  int d[r][4] ;
  rep(i,r){
      rep(j,4){
          cin>> d[i][j] ;
      }
  }
  vector<pair<pair<int,int>,int>> A(t) ;
  rep(i,t){
   A[i].se = i+1 ;
  }
  int pe[t][p] ;
  rep(i,t){
      rep(j,p) pe[i][j]= 0 ;
  }
  rep(i,r){
  
  if(d[i][3]==0){
      A[d[i][1]-1].fi.fi ++ ;
      A[d[i][1]-1].fi.se = (A[d[i][1]-1].fi.se+d[i][0])
      +pe[d[i][1]-1][d[i][2]-1]*20 ;

  }
  else pe[d[i][1]-1][d[i][2]-1]++ ;
  }
  rep(i,t) A[i].fi.se *= -1 ;
  sort(A.rbegin(),A.rend()) ;
  rep(i,t){
      auto x= A[i] ;
      int w= A[i].se ;
      if(t==1){
          cout<<1<<endl ;
          break ;
      }
  if(i==0) cout<<w ;
  else if(i==t-1){
     auto y= A[i-1] ;

      if(x.fi.fi==y.fi.fi && x.fi.se==y.fi.se){
          cout<<"="<< w <<endl;
      }
      else{
          cout<<","<< w <<endl;
      } 
  }
  else{
      auto y= A[i-1] ;

      if(x.fi.fi==y.fi.fi && x.fi.se==y.fi.se){
          cout<<"="<< w ;
      }
      else{
          cout<<","<< w ;
      }
  }
  }

  }
  return 0 ; 
}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <tuple>
using namespace std;

int main()
{
	int M, T, P, R, m, t, p, j;
	while (cin >> M >> T >> P >> R, M || T || P || R) {
		vector< vector< pair<int, int> > > data(T + 1, vector< pair<int, int> >(P, pair<int, int>(0,0)));
		vector< tuple<int, int, int> > score(T + 1);
		for (int i = 0; i < R; i++) {
			cin >> m >> t >> p >> j;
			if (j == 0) {
				data[t][p].first = m + data[t][p].second * 20;
			}
			else {
				data[t][p].second++;
			}
		}
		for (int i = 1; i <= T; i++) {
			int sco = 0,pena = 0;
			for (int j = 0; j < P; j++) {
				if (data[i][j].first) {
					sco--;
					pena += data[i][j].first;
				}
			}
			score[i] = tuple<int, int, int>(sco,pena,-i);
		}
		sort(score.begin()+ 1, score.end());
		tuple<int, int, int> temp = score[1];
		cout << -get<2>(score[1]);
		for (int i = 2; i <= T; i++) {
			if (get<0>(temp) == get<0>(score[i]) && get<1>(temp) == get<1>(score[i])) {
				cout << "=";
			}
			else {
				cout << ",";
			}
			cout << -get<2>(score[i]);
			temp = score[i];
		}
		cout << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <stack>

using namespace std;

#define INF 1010001000
#define EPS 1e-10
#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

typedef pair<int, int> i_i;
typedef long long int llong;
typedef pair<llong, llong> ll_ll;
typedef struct edge {int f, t;}Edge;
typedef pair<int, pair<int, int> > Team;
typedef pair<int, pair<int, pair<int, int> > > input;

int m, t, p, r;

int main()
{
    while (cin >> m >> t >> p >> r, m) {
        vector<Team > team(t);
        vector<vector<int> > check(t, vector<int>(t, 0));
        vector<input > data(r);
        rep(i, t) {
            team[i].second.second = i+1;
            team[i].first = 0;
            team[i].second.first = 0;
        }
        rep(i, r) {
            cin >> data[i].first >> data[i].second.first
                >> data[i].second.second.first 
                >> data[i].second.second.second;
            data[i].first;
            data[i].second.first--;
            data[i].second.second.first--;
            data[i].second.second.second;
        }
        sort(data.begin(), data.end());
        rep(i, r) {
            int a = data[i].first, b = data[i].second.first, 
                c = data[i].second.second.first, 
                d = data[i].second.second.second;
            if (d) {
                if (check[b][c] != -1) {
                    check[b][c]++;
                }
            } else {
                if (check[b][c] != -1) {
                    team[b].first++;
                    team[b].second.first 
                        -= data[i].first + check[b][c] * 20;
                    check[b][c] = -1;
                }
            }
        }
        sort(team.begin(), team.end(), greater<Team>());
        cout << team[0].second.second;
        for (int i = 1; i < t; i++) {
            if (team[i].first == team[i-1].first && 
                    team[i].second.first == team[i-1].second.first) {
                cout << "=" << team[i].second.second;
            } else {
                cout << "," << team[i].second.second;
            }
        }
        cout << endl;
    }

    return 0;
}