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 <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#define INF 2000000000
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
#define ll long long
#define PL pair<long long, long long>
#define P pair<int,int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;

struct test{
  int team_name,answers;
};

int main(){
  while(1){
    int m,t,p,r;
    cin>>m>>t>>p>>r;
//    cout<<en
    if(m==t&&t==p&&p==r&&r==0) break;
    test teams[55];
    int mistake[55][11]={0};
    int times[55]={0};
    for(int i=0; i<55; i++){
      teams[i].answers=0;
      times[i]=0;
    }
    vector<P> ve;
    for(int i=0; i<r; i++){
      int time,team,id,judge;
      cin>>time>>team>>id>>judge;
      if(judge) mistake[team][id]++;
      else{
        teams[team].answers++;
        times[team]+=mistake[team][id]*20+time;
      }
    }
    
    for(int i=1; i<=t; i++){
      ve.push_back(mk(teams[i].answers,i));
//      cout<<"   i = "<<i;
//      cout<<"          ans = "<<teams[i].answers<<en
    }
//
//    cout<<en
    
    sort(ve.begin(), ve.end(), greater<P>());
//    for(auto v=0; v<ve.size(); v++){
//      cout<<ve[v].second<<"  time:  "<<times[ve[v].second]<<en
//    }
//    cout<<en
//    cout<<en
    
    for(int v=1; v<ve.size(); v++){
      P now=ve[v];
      int j=v-1;
      while(j>=0&&ve[j].first==now.first&&times[now.second]<times[ve[j].second]){
        ve[j+1]=ve[j];
        j--;
      }
      ve[j+1]=now;
    }
    
    for(int i=0; i<ve.size(); i++){
      cout<<ve[i].second;
      if(i==ve.size()-1) break;
      if(ve[i].first==ve[i+1].first&&times[ve[i].second]==times[ve[i+1].second]) cout<<'=';
      else cout<<',';
    }
    cout<<en
  }
  RE
}

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

typedef pair<int, int> P;

typedef struct{
	int id;
	int solve;
	int time;
	int penal[20];
	int sort_s;
	int sort_t;
}Team;

Team teams[100];
vector< P > ssolve;

int main(void){
	while(1){
		int m, t, p, r;
		cin >> m >> t >> p >> r;
		if(m == 0 && t == 0 && p == 0 && r == 0) break;

		ssolve.clear();
		for(int i=0; i<t; i++){
			teams[i].id = i;
			teams[i].solve = 0;
			teams[i].time = 0;
			for(int j=0; j<p; j++){
				teams[i].penal[j] = 0;
			}
		}

		for(int i=0; i<r; i++){
			int tm, tt, tp, tj;
			cin >> tm >> tt >> tp >> tj;

			tt--;
			if(tj == 0){
				teams[tt].solve++;  
				teams[tt].time += tm;
				if(teams[tt].penal[tp] != 0) {
					teams[tt].time += teams[tt].penal[tp];
					teams[tt].penal[tp] = 0;
				}
			}else{
				teams[tt].penal[tp] += 20;
			}

		}

		/*
		for(int i=0; i<t; i++){
			ssolve.push_back(P(teams[i].solve, i));
			//cout << "sol:" << teams[i].time << endl;
		}
		sort(ssolve.begin(), ssolve.end(), greater<P>());

		int cnt = 0;
		teams[ssolve[0].second].sort_s = cnt;
		int same_s = ssolve[0].first;
		for(int i=1; i<t; i++){
			if(same_s == ssolve[i].first){
				teams[ssolve[i].second].sort_s = teams[ssolve[i-1].second];
			}else{
				cnt++;
				teams[ssolve[i].second].sort_s = cnt;
			}
		}

		//time?????????????????????
		for(int i=0; i<t; i++){
			stime.push_back(P(teams[i].time, i));
			//cout << "sol:" << teams[i].time << endl;
		}
		sort(stime.begin(), stime.end());
		cnt = 0;
		teams[stime[0].second].sort_t = cnt;
		int same_t = stime[0].first;
		for(int i=1; i<t; i++){
			if(same_t == stime[i].first){
				teams[stime[i].second].sort_t = teams[stime[i-1].second];
			}else{
				cnt++;
				teams[stime[i].second].sort_t = cnt;
			}
		}
		*/

		/*
		for(int i=0; i<t; i++){
			printf("%d %d\n", ssolve[i].first, ssolve[i].second + 1);

		}
		*/

		for(int i=0; i<t-1; i++){
			for(int j=t-1; j>i; j--){
				if(teams[j].solve > teams[j-1].solve){
					Team tmp = teams[j];
					teams[j] = teams[j-1];
					teams[j-1] = tmp;
				}else if(teams[j].solve == teams[j-1].solve && teams[j].time < teams[j-1].time){
					Team tmp = teams[j];
					teams[j] = teams[j-1];
					teams[j-1] = tmp;
				}else if(teams[j].solve == teams[j-1].solve && teams[j].time == teams[j-1].time && teams[j].id > teams[j-1].id){
					Team tmp = teams[j];
					teams[j] = teams[j-1];
					teams[j-1] = tmp;
				}
			}
		}

		for(int i=0; i<t; i++){
			printf("%d", teams[i].id + 1);
			if(i + 1 != t){
				if(teams[i+1].solve != teams[i].solve){
					printf(",");
				}else if(teams[i+1].solve == teams[i].solve && teams[i+1].time != teams[i].time){
					printf(",");
				}else{
					printf("=");
				}
			}
		}
		puts("");

	}


	return 0;
}