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 <map>
#include <algorithm>
using namespace std;

struct TEAM{
  int correct;
  int time;
  int num;
};

bool compare(const TEAM &a,const TEAM &b){
  if(a.correct==b.correct){
  	if(a.time==b.time) return a.num>b.num;
  	else return b.time>a.time;
  }
  else return a.correct>b.correct;
}


int main(void){
  int M,T,P,R;
  while(cin>>M>>T>>P>>R,M||T||P||R){
    int m,t,p,j;
    map<int,map<int,int> > ttime;
    map<int,int> times,correct;
    for(int i=0;i<R;++i){
      cin>>m>>t>>p>>j;
      if(j==0){
        correct[t]++;
        ttime[p][t]+=m;
        times[t]+=ttime[p][t];
      }else{
        ttime[p][t]+=20;
      }
    }
    vector<TEAM> tt(T);
    for(int i=1;i<=T;++i){
      tt[i-1].time=times[i];
      tt[i-1].correct=correct[i];
      tt[i-1].num=i;
    }
    sort(tt.begin(),tt.end(),compare);
    int oc=tt[0].correct,ot=tt[0].time;
    cout<<tt[0].num;
    for(int i=1;i<T;++i){
      if(oc==tt[i].correct,ot==tt[i].time)cout<<"=";
      else cout<<",";
      cout<<tt[i].num;
      oc=tt[i].correct,ot=tt[i].time;
    }
    cout<<endl;
  }
  return 0;
}

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

using namespace std;

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

#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back
#define sz size()

class TEAM{
public:
    int pena[20]={};
    int sum=0;
    int time=0;
    int num=0;
    int point=0;
};

int main(){
    int M,T,P,R;
    while(cin>>M>>T>>P>>R){
        TEAM team[100];
        
        
        if(M==0 && T==0 && P==0 && R==0)break;
        
        rep(i,T)team[i].num=i+1;
        
        rep(i,R){
            int m,t,p,j;
            cin>>m>>t>>p>>j;
            t--;
            if(j==0){
                team[t].sum++;
                team[t].time+=m+team[t].pena[p]*20;
            }else{
                team[t].pena[p]++;
            }
        }
        
        rep(i,T){
            team[i].point=team[i].sum*100000000 + 10000000-team[i].time;
        }

        for(int i=0;i<T-1;i++){
            for(int j=T-1;j>i;j--){
                if(team[j].point<team[j-1].point)swap(team[j],team[j-1]);
            }
        }
        
        cout<<team[T-1].num;
//        cout<<" "<<team[T-1].point<<endl;
        for(int i=T-2;i>=0;i--){
            if(team[i+1].point==team[i].point){
                cout<<"="<<team[i].num;
//                cout<<" "<<team[i].point<<endl;
            }
            else{
                cout<<","<<team[i].num;
//                cout<<" "<<team[i].point<<endl;
            }
        }
        cout<<endl;
    }
    return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitset>
#define INF 2000000000
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
#define ll long long
#define PL pair<long long, long long>
#define PR pair<int,int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;
#define int ll

//ICPC Ranking  AOJ

#define MAX 60
int tt[55];
int pena[55][15];
int point[55];
bool done[MAX];

signed main(){
  cout<<"Hello,World!"<<en
  int M,T,P,R;
  while(cin>>M>>T>>P>>R&&!(M==0&&T==0&&P==0&&R==0)){
    for(int i=0; i<=55; i++){
      for(int j=0; j<=15; j++){
        pena[i][j]=0;
      }
      tt[i]=0;
      point[i]=0;
      done[i]=false;
    }
    
    for(int i=0; i<R; i++){
      int m,t,p,j;
      cin>>m>>t>>p>>j;
      if(j){
        pena[t][p]++;
      }else{
        tt[t]+=m;
        tt[t]+=pena[t][p]*20;
        point[t]++;
      }
    }
    
    PR pre;
    for(int i=1; i<=T; i++){
      int m=0,t=0;
      int nowt=0;
      for(int j=1; j<=T; j++){
        if(done[j]) continue;
        if(point[j]>m){
          nowt=j;
          m=point[j];
          t=tt[j];
        }else if(point[j]==m){
          if(tt[j]<=t){
            nowt=j;
            m=point[j];
            t=tt[j];
          }
        }
      }
      
      done[nowt]=true;
      if(i==1) cout<<nowt;
      else{
        if(pre.first==m&&pre.second==t){
          cout<<'='<<nowt;
        }else{
          cout<<','<<nowt;
        }
      }
      
      pre.first=m; pre.second=t;
    }
    cout<<en
  }
  RE
}