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>
#define N 2001
using namespace std;
struct team{
  int tnum;
  int correct;
  int time;
};
int main(){
  int m,t,p,r,im[N],it[N],ip[N],ij[N],incorrect,i,j;
  struct team data[51];
  while(1){
    cin >> m >> t >> p >> r;
    if(m==0&&t==0&&p==0&&r==0) break;
    for(i=0;i<r;i++) cin >> im[i] >> it[i] >> ip[i] >> ij[i];
    for(i=1;i<=t;i++){
      data[i].tnum=i;
      data[i].correct=0;
      data[i].time=0;
    }
    for(i=0;i<r;i++){
      if(ij[i]==0){
	data[it[i]].correct++;
      	incorrect=0;
	for(j=0;j<i;j++){
	  if(it[i]==it[j]&&ip[i]==ip[j]) incorrect++;
	}
	data[it[i]].time=data[it[i]].time+incorrect*20+im[i];
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].tnum>data[j-1].tnum) swap(data[j],data[j-1]);
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].time<data[j-1].time) swap(data[j],data[j-1]);
      }
    }
    for(i=0;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].correct>data[j-1].correct) swap(data[j],data[j-1]);
      }
    }
    for(i=1;i<t;i++){
      cout << data[i].tnum;
      if(data[i].correct==data[i+1].correct&&data[i].time==data[i+1].time)
	cout << '=';
      else cout << ',';
      if(i==t-1) cout << data[i+1].tnum;
    }
    cout << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Team {
	int tid, ac, penalty;
	Team() { tid = -1, ac = 0, penalty = 0; }
};
bool operator >(const Team& t1, const Team& t2) {
	if (t1.ac == t2.ac) {
		if (t1.penalty == t2.penalty) return t1.tid > t2.tid;
		else return t1.penalty < t2.penalty;
	}
	else return t1.ac > t2.ac;
}
bool operator ==(const Team& t1, const Team& t2) {
	return t1.ac == t2.ac && t1.penalty == t2.penalty;
}

int main() {
	int M, T, P, R;
	while ( cin >> M >> T >> P >> R, M || T || P || R ) {
		int wa[50][10] = {0};
		int ac[50][10] = {0};
		vector<Team> tdt(T);
		for (int i = 0; i < T; ++i) tdt[i].tid = i+1;
		for (int i = 0; i < R; ++i) {
			int m, t, p, j; cin >> m >> t >> p >> j;
			--t, --p;
			if (j == 0) {
				if (ac[p][t] == 0) {
					++ac[p][t];
					++tdt[t].ac;
					tdt[t].penalty += m + 20 * wa[p][t];
				}
			}
			else {
				++wa[p][t];
			}
		}
		sort( tdt.begin(), tdt.end(), greater<Team>() );
		for (int i = 0; i < tdt.size(); ++i) {
			if (i) {
				if (tdt[i] == tdt[i-1]) cout << "=";
				else cout << ",";
			}
			cout << tdt[i].tid;
		}
		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;
}