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

class Rank {
public:
  Rank() {}
  Rank(int s, int ti, int te) : s(s), ti(ti), te(te) {}
  int s, ti, te;
};
bool comp (const Rank &r1, const Rank &r2) {
  if(r1.s == r2.s && r1.s == 0) return r1.te < r2.te;
  return r1.s!=r2.s ? r1.s<r2.s : (r1.ti!=r2.ti ? r1.ti<r2.ti : r1.te<r2.te);
}

int main() {
  int m, t, p, j;
  int M, T, P, R;
  vector<Rank> rank;
  while(cin >> M >> T >> P >> R && M+T+P+R) {
    rank.clear();
    int penal[55][12];
    bool solved[55][12];

    fill(penal[0], penal[52], 0);
    fill(solved[0], solved[52], 0);

    for(int ii = 0; ii < R; ii++) {
      cin >> m >> t >> p >> j;
      p--; t--;
      if(j != 0) penal[t][p] += 20;
      else penal[t][p] += m, solved[t][p] = true;
    }
    for(int i=0; i<T; i++) {
      int sum = 0;
      for(int j=0; j<P;j++) {
	if(solved[i][j]) sum += penal[i][j];
      }
      int ssum = 0;
      for(int j=0; j<P; j++) {
	ssum += solved[i][j];
      }
      rank.push_back(Rank(-ssum, sum,-i-1));
    }
    sort(rank.begin(), rank.end(), comp);
    
    bool flag = 0;
    for(int i=0; i<rank.size(); i++) {
      if(flag && rank[i-1].s == rank[i].s && rank[i-1].ti == rank[i].ti) cout << "=";
      else if(flag) cout << ",";
      cout << -rank[i].te;
      flag = 1;
    }
    cout << endl;
  }
  
  return 0;
}

C++: #include<cstdio>
#include<map>
#include<vector>
#include<algorithm>
#include<cstring>

using namespace std;

int wrong[100][100];

int main(void) {
    while(true) {
        int M,T,P,R;
        scanf("%d%d%d%d", &M, &T, &P, &R);
        if(!M) break;

        vector<pair<pair<int,int>,int> > pt(T); // solved, -time, tid

        memset(wrong, 0, sizeof(wrong));
        for(int i=0; i<T; i++) {
            pt[i].second = i+1;
        }
        for(int i=0; i<R; i++) {
            int m,t,p,j;
            scanf("%d%d%d%d", &m,&t,&p,&j);
            if(!j) { // success
                pt[t-1].first.first++;
                pt[t-1].first.second -= m;
                pt[t-1].first.second -= 20*wrong[t-1][p-1];
            } else { // fail
                wrong[t-1][p-1]++;
            }
        }

        sort(pt.begin(), pt.end());
        reverse(pt.begin(), pt.end());

        pair<int,int> last = pt[0].first;
        printf("%d", pt[0].second);
        for(int i=1; i<pt.size(); i++) {
            if(pt[i].first == last)
                printf("=");
            else
                printf(",");
            printf("%d", pt[i].second);
            last = pt[i].first;
        }
        printf("\n");

    }
    return 0;
}

C++: #include<iostream>
#include<string.h>
using namespace std;

const int INF=50000000;

int data[51][12];

int main(){
	int M,T,P,R;
	while(cin>>M>>T>>P>>R && M){
		fill((int*)data,(int*)(data+12),0);
		for(int i=0;i<R;i++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			if(j==0){
				data[t][0]++;
				data[t][11]+=m+data[t][p]*20;
			}
			else data[t][p]++;
		}
		int prev[2]={INF,0};
		for(int i=0;i<T;i++){
			int ans=0;
			int now[2]={0,INF};
			for(int j=T;j>=0;j--){
				if(data[j][0]>now[0]){
					now[0]=data[j][0];
					now[1]=data[j][11];
					ans=j;
				}
				else if(data[j][0]==now[0] && data[j][11]<now[1]){
					now[1]=data[j][11];
					ans=j;
				}
			}
			if(i){
				if(memcmp(now,prev,sizeof(now))==0)cout<<"=";
				else cout<<",";
			}
			cout<<ans;
			memcpy(prev,now,sizeof(now));
			data[ans][0]=-1;
		}
		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 + 1, 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;
}