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 <stdio.h>

typedef struct{
  int team;
  int ans[10];
  int time[10];
  int anum;
  int tnum;
}data_t;

void BubbleSort(data_t data[], int n){  
  data_t temp;

  for(int i=n; 1<i; i--){
    for(int j=0; j<i-1 ; j++){
      if(data[j].anum < data[j+1].anum){
	temp = data[j];
	data[j] = data[j+1];
	data[j+1] = temp;
      }
    }
  }

  for(int i=n; 1<i; i--){
    for(int j=0; j<i-1; j++){
      if(data[j].anum==data[j+1].anum && data[j].tnum>data[j+1].tnum){
	temp = data[j];
	data[j] = data[j+1];
	data[j+1] = temp;
      }
    }
  }

  for(int i=n; 1<i; i--){
    for(int j=0; j<i-1 ;j++){
      if(data[j].anum==data[j+1].anum && data[j].tnum==data[j+1].tnum && data[j].team<data[j+1].team){
	temp = data[j];
	data[j] = data[j+1];
	data[j+1] = temp;
      }
    }
  }
}

int main(void){
  int M, T, P, R;
  int m, t, p, j;
  data_t data[50];
  while(1){
    scanf("%d%d%d%d", &M, &T, &P, &R);
    if(M==0 && T==0 && P==0 && R==0){
      break;
    }

    for(int i=0; i<T; i++){
      data[i].team = i+1;
      data[i].anum = 0;
      data[i].tnum = 0;
      for(int j=0; j<10; j++){
	data[i].ans[j] = 1;
	data[i].time[j] = 0;
      }
    }

    for(int i=0; i<R; i++){
      scanf("%d%d%d%d", &m, &t, &p, &j);
      if(j == 0){
	data[t-1].ans[p-1] = 0;
	data[t-1].time[p-1] += m;
      }else{
	data[t-1].time[p-1] += 20;
      }
    }
    for(int i=0; i<T; i++){
      for(int j=0; j<P; j++){
	if(data[i].ans[j] == 0){
	  data[i].anum++;
	  data[i].tnum += data[i].time[j];
	}
      }
    }
    BubbleSort(data, T);

    printf("%d", data[0].team);
    for(int i=1; i<T; i++){
      if(data[i].anum==data[i-1].anum && data[i].tnum==data[i-1].tnum){
	printf("=");
      }else{
	printf(",");
      }
      printf("%d", data[i].team);
    }
    printf("\n");
  }
  return 0;
}

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

struct Info{
	int id,cost,ac;
};

bool operator < (const Info &a,const Info &b){
	if(a.ac!=b.ac) return a.ac>b.ac;
	if(a.cost!=b.cost) return a.cost<b.cost;
	return a.id>b.id;
}

int main()
{
	int M,T,P,R;
	while(cin>>M>>T>>P>>R){
		if(M==0) break;
		vector<vector<int> >num_WA(T,vector<int>(P,0));
		vector<int> cost(T,0);
		vector<int> num_AC(T,0);
		for(int i=0;i<R;i++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			t--;
			if(j==0){
				cost[t] += m+num_WA[t][p]*20;
				num_AC[t]++;
			}
			else{
				num_WA[t][p]++;
			}
		}
		vector<Info> temp;
		for(int i=0;i<T;i++){
			Info hoge;
			hoge.cost=cost[i];
			hoge.id=i+1;
			hoge.ac=num_AC[i];
			temp.push_back(hoge);
		}
		sort(temp.begin(),temp.end());
		int bef_ac=0,bef_cost=0;
		for(int i=0;i<temp.size();i++){
			if(i!=0){
				if(bef_ac==temp[i].ac && bef_cost==temp[i].cost){
					cout<<"=";
				}
				else cout<<",";
			}
			cout<<temp[i].id;
			bef_ac=temp[i].ac;
			bef_cost=temp[i].cost;
		}
		cout<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>

typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define DECIM8  fixed<<setprecision(8) 
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

using namespace std;
int main(void)
{
  for(;;){
    int m,t,p,r;
    cin >> m >> t >> p >> r;
    if(!m&&!t&&!p&&!r) return 0;
    vector<vector<int> > act;
    // t,p: -20*wa
    act.resize(t);
    REP(i,t) act[i].assign(p,0);
    REP(i,r){
      int tid,pid,time,sta;
      cin >> time >> tid >> pid >> sta;
      time++;tid--;pid--;
      if(act[tid][pid]>0) continue;
      if(sta) act[tid][pid]-=20;
      else act[tid][pid]=time-act[tid][pid];
    }
    vector<pair<pair<int,int>,int> > score;
    // -AC,penalty,-team
    REP(i,t) score.PB(MP(MP(0,0),-i-1));
    REP(i,t) REP(j,p) if(act[i][j]>0){
      score[i].first.first-=1;
      score[i].first.second+=act[i][j];
    }
    SORT(score);
    REP(i,t){
      if(i){
	if(score[i-1].first==score[i].first) cout << '=';
	else cout << ',';
      }
      cout << -score[i].second;
    }
    cout << endl;
  }
}