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 InsSort(data_t data[], int n){
  data_t temp;
  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j].team>data[j-1].team ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j-1] = temp;
    }
  }

  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j].tnum<data[j-1].tnum ;j--){
      temp = data[j];
      data[j] = data[j-1];
      data[j-1] = temp;
    }
  }
  
  for(int i=1; i<n; i++){
    for(int j=i; j>0 && data[j].anum>data[j-1].anum ;j--){
      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 if(j == 1){
	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];
	}
      }
    }
    InsSort(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].tnum){
	printf("=");
      }else{
	printf(",");
      }
      printf("%d", data[i].team);
    }
    printf("\n");
  }
  return 0;
}

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

using namespace std;

#define INF 1e9

int MOD=1e9+7;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    while(1){
        int m,t,p,r;
        cin>>m>>t>>p>>r;

        if(m==0)break;

        vector<pair<pair<long long,long long>,long long>> v(t);
        int wa[60][20]={};
        for(int i=0;i<t;i++){
            v[i].second=i+1;
        }

        for(int i=0;i<r;i++){
            int a,b,c,d;
            cin>>a>>b>>c>>d;
            b--;
            c--;

            if(d!=0)wa[b][c]++;
            else{
                v[b].first.first++;
                v[b].first.second+=a+wa[b][c]*20;
            }
        }
        for(int i=0;i<t;i++){
            v[i].first.second*=-1;
        }
        sort(v.begin(),v.end());
        reverse(v.begin(),v.end());
        for(int i=0;i<t;i++){
            cout<<v[i].second;
            if(i==t-1)cout<<endl;
            else if(v[i].first==v[i+1].first)cout<<"=";
            else cout<<",";
        }
    }
}

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

using namespace std;

struct team{
  int id;
  int ac;
  int tm;
  int wa[10];
  bool operator < (const team &right) const {
    if(ac != right.ac) return ac > right.ac;
    if(tm != right.tm) return tm < right.tm;
    return id > right.id;
  }
  bool operator == (const team &right) const {
    return ac == right.ac && tm == right.tm;
  }
};

int main()
{
  int M, T, P, R;
  while(cin >> M >> T >> P >> R, M || T || P || R){
    team te[50];
    for(int i = 0; i < T; i++){
      te[i].id = i + 1;
      te[i].ac = 0;
      te[i].tm = 0;
      memset(te[i].wa, 0, sizeof(te[i].wa));
    }
    while(R--){
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      t--, p--;
      if(j == 0){
	te[t].ac++;
	te[t].tm += m + te[t].wa[p]*20;
      } else {
	te[t].wa[p]++;
      }
    }
    sort(te, te + T);
    cout << te[0].id;
    for(int i = 1; i < T; i++){
      cout << (te[i] == te[i-1] ? "=":",") << te[i].id;
    }
    cout << endl;
  }
  return 0;
}

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

class team{
public:
	int num, ans, time;
	team(int n){
		num = n;
		ans = time = 0;
	}
	bool operator<(const team &t2)const{
		if (ans != t2.ans)
			return ans > t2.ans;
		else if (time != t2.time)
			return time < t2.time;
		else
			return num > t2.num;
	}
};

int main()
{
	int M, T, P, R, m[2001], t[2001], p[2001], r[2001], before;
	while (cin >> M >> T >> P >> R, (M || T || P || R)){
		vector<team> v;
		vector<team>::iterator pv;
		//入力
		for (int i = 0; i < R; i++){
			cin >> m[i] >> t[i] >> p[i] >> r[i];
		}

		//各チームの時間
		for (int i = 1; i <= T; i++){
			team te = team(i);
			for (int j = 0; j < R; j++){
				//正解時間の計算
				if (t[j] == i && r[j] == 0){
					te.time += m[j];
					te.ans++;
					//以前のペナルティを計算
					for (int k = 0; k < j; k++){
						if (t[k] == i && p[k] == p[j]){
							te.time += 20;
						}
					}
				}
			}
			v.push_back(te);
		}

		//ソート
		sort(v.begin(), v.end());
		pv = v.begin();
		before = -1;
		while (pv != v.end()){
			if (before == pv->time)
				cout << "=" << pv->num;
			else {
				if (pv == v.begin())
					cout << pv->num;
				else
					cout << "," << pv->num;
				before = pv->time;
			}
			pv++;
		}
		cout << endl;
	
	}
	return 0;
}