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<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bitset>
#include<list>
#include<numeric>
#include<complex>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<long long, long long> ll_ll;
typedef pair<double, double> d_d;
typedef vector<int> Vint;

#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define rep2d(i, j, n) for(i = 0;i < n;++i)for(j = i + 1;j < n;++j)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define scn(n, a) rep(i, n)cin >> a[i]
#define sc2n(n, a, b) rep(i, n)cin >> a[i] >> b[i]
#define pri(x) cout << x << "\n"
#define pri2(x, y) cout << x << " " << y << "\n"
#define pri3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define endl "\n"
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << x << "\n"
#define debug2(x, y) cout << " --- " << x << " " << y << "\n"
#define debug3(x, y, z) cout << " --- " << x << " " << y << " " << z << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)

struct result{
  int id, ac, time;
  Vint pena;
  void use(int n){ pena.assign(n, 0); return; }
};

bool myc(result a, result b){
  if(a.ac == b.ac && a.time == b.time)return a.id > b.id;
  if(a.ac == b.ac)return a.time < b.time;
  return a.ac > b.ac;
}
bool my(result a, result b){
  return (a.ac == b.ac && a.time == b.time);
}


signed main(void){
  int i, j, k;
  for(int testcase = 0;testcase < 1234567;testcase++){
    int m, t, p, r;
    cin >> m >> t >> p >> r;
    if((m | t | p | r) == 0)break;

    vector<result> team;
    team.resize(t);
    rep(i, t){
      team[i].use(p); team[i].id = i + 1;
    }

    for(;r--;){
      int x, y, z, v;
      cin >> v >> x >> y >> z;
      x--; y--;
      if(z)team[x].pena[y]++;
      else{
        team[x].ac++;
        team[x].time += v + team[x].pena[y] * 20;
      }
    }

    sort(all(team), myc);
    cout << team[0].id;
    rep1(i, t){
      if(my(team[i - 1], team[i]))printf("=%d", team[i].id);
      else printf(",%d", team[i].id);
    }
    kara;

//*/

//*/ break;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct S{
  int number;
  int AC[10]={},WA[10]={},time=0;
  int sumAC=0;
};
bool cmp(S a,S b){
  if(a.sumAC==b.sumAC){
      if(a.time==b.time)return a.number>b.number;
      return a.time<b.time;
  }
  return a.sumAC>b.sumAC;
 
}
signed main (){
  int M,T,P,R;
  while(cin>>M>>T>>P>>R&&M){
    vector<S> v(T);
    for(int i=0;i<T;i++)v[i].number=i+1; //まずは番号を入れる
    for(int i=0;i<R;i++){
      int m,t,p,j;
      cin>>m>>t>>p>>j;
      t--;p--; //0-indexに
      if(j==0){ //正解なら
          v[t].AC[p]++;
          v[t].time+=v[t].WA[p]*20;
          v[t].time+=m;
      }
      else v[t].WA[p]++; //誤答なら
    }
    for(int i=0;i<T;i++){
      for(int j=0;j<P;j++){
        v[i].sumAC+=v[i].AC[j]; //各チームの正解数を求める
      }
    }
    sort(v.begin(),v.end(),cmp); //上で書いた比較関数cmpを使ってソート。配列の中身が強い順になる
 
    for(int i=0;i<T;i++){
      cout<<v[i].number;
      while(i+1<T&&v[i].sumAC==v[i+1].sumAC&&v[i].time==v[i+1].time){ //順位が同じ時の処理
          i++;
          cout<<'='<<v[i].number;
      }
      if(i!=T-1)cout<<','; //最後はカンマ打ちません
    }
    cout<<endl;
  }
}

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;
				get<0>(score[t])--;
			}
			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>(get<0>(score[i]),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;
}