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<vector>
#include<algorithm>

using namespace std;

int main(){

  while(true){
    int M,T,P,R;
    cin>>M>>T>>P>>R;
    if(!M and !T and !P and !R)break;

    vector< vector<bool> > is_ac(T,vector<bool>(P,false));
    vector< vector<int> > wa_num(T,vector<int>(P,0));
    vector< pair< pair<int,int> ,int > > point(T);

    for(int i=0;i<T;i++){
      point[i].second=i+1;
    }
    
    for(int i=0;i<R;i++){
      int m,t,p,j;
      cin>>m>>t>>p>>j;
      //cout<<m<<" "<<t<<" "<<p<<" "<<j<<endl;
      t--;
      p--;
      if(j==0){
        is_ac[t][p]=true;
        point[t].first.first++;
        point[t].first.second+=m*(-1);
      }
      else{
        wa_num[t][p]++;
      }
    }

    for(int i=0;i<T;i++){
      for(int j=0;j<P;j++){
        if(is_ac[i][j]){
          point[i].first.second-=wa_num[i][j]*20;
        }
      }
    }
    
    sort(point.begin(),point.end());
    reverse(point.begin(), point.end());


    for(int i=0;i<T;i++){
      if(i>0){
       if(point[i].first==point[i-1].first)printf("=");
       else printf(",");
      }
      printf("%d",point[i].second);
    }
    puts("");
  }
  
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
	int M,T,P,R;
	while(cin>>M>>T>>P>>R,M+T+P+R){
		bool h[51][11]={0};
		int pe[51][11]={0};
		int sum[51]={0};
		int co[51]={0};
		int m,t,p,ju;
		rep(i,R){
			cin>>m>>t>>p>>ju;
			t--;p--;
			if(!ju){//OK
				h[t][p]=true;
				sum[t]+=m+20*pe[t][p];
				co[t]++;
			}else pe[t][p]++;
		}
		int out[51];
		rep(i,50)out[i]=i;
		loop(i,1,T)for(int j=T-1;j>=i;j--){
			if(co[out[j-1]]<co[out[j]])swap(out[j-1],out[j]);
			else if(co[out[j-1]]==co[out[j]]&&sum[out[j-1]]>sum[out[j]])
				swap(out[j-1],out[j]);
			else if(co[out[j-1]]==co[out[j]]&&
					sum[out[j-1]]==sum[out[j]]&&
					out[j-1]<out[j])
				swap(out[j-1],out[j]);

		}
		rep(i,T){
			if(i){
				if(co[out[i-1]]==co[out[i]]&&sum[out[i-1]]==sum[out[i]])cout<<"=";
				else cout<<',';
			}
			cout<<out[i]+1;
		}
		cout<<endl;
	}
}

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>(p, 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.second.second
                >> data[i].second.second.first 
                >> data[i].second.first;
            data[i].second.second.second--;
            data[i].second.second.first--;
            data[i].second.first *= -1;
        }
        sort(data.begin(), data.end());
        rep(i, r) {
            int a = data[i].first, b = data[i].second.second.second, 
                c = data[i].second.second.first, 
                d = data[i].second.first;
            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;
}