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 <bits/stdc++.h>
using namespace std;

class Team{
  public:
  int id;
  int solvednum;
  int penalty;
  vector<bool> solved;
  vector<int> WA;
  Team(int id, int N){
    this->id = id;
    solvednum = 0;
    penalty = 0;
    solved.resize(N, false);
    WA.resize(N, 0);
  }
  bool operator == (const Team &t)const{
    return id == t.id;
  }
  bool operator < (const Team &t)const{
    if(solvednum == t.solvednum){
      if(penalty == t.penalty){
        return id > t.id;
      }
      return penalty < t.penalty;
    }
    return solvednum > t.solvednum;
  }
  string toString(){
    return to_string(id) + " " + to_string(solvednum) + " " + to_string(penalty);
  }
};

int main(void){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int M, T, P, R;
  while(cin >> M >> T >> P >> R, M | T | P | R){
  vector<Team> teams;
  for(int i = 0;  i < T; i++){
    teams.push_back(Team(i+1, P));
  }
  for(int asd = 0; asd < R; asd++){
    int m, t, p, j;
    cin >> m >> t >> p >> j;
    t--;
    if(j == 0){
      teams[t].solved[p] = true;
      teams[t].solvednum++;
      teams[t].penalty += m + 20*teams[t].WA[p];
    }else{
      teams[t].WA[p]++;
    }
  }
  sort(teams.begin(), teams.end());

  cout << teams[0].id;
  for(int i = 1; i < T; i++){
    if(teams[i].solvednum == teams[i-1].solvednum && teams[i].penalty == teams[i-1].penalty){
      cout << '=';
    }else{
      cout << ',';
    }
    cout << teams[i].id;
  }
  cout << endl;
  }
  return 0;
}

C++: #include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<deque>
#include<regex>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef int long long ll;


int main() {

    int ti[50];
    int ta[50];
    int wa[50][10];
    while(true){
        int m,t,p,r;
        cin>>m>>t>>p>>r;
        if(m==0&&t==0&&p==0&&r==0)break;
        rep(i,50){ti[i]=0;ta[i]=0;}
        rep(i,50){rep(j,10){wa[i][j]=0;}}
        rep(rr,r){
            int time,team,pron,han;
            cin>>time>>team>>pron>>han;
            if(han!=0){
                wa[team-1][pron-1]++;
            }else{
                int k=wa[team-1][pron-1];
                wa[team-1][pron-1]=0;
                ti[team-1]++;
                ta[team-1]+=k*20+time;
            }
        }

        vector<tuple<int,int,int>> zyun;
        //vector<pair<int,int>> zyuni;
        rep(i,t){
            zyun.emplace_back(ti[i],-ta[i],i+1);
           // zyuni.push_back({ti[i],-ta[i]});
        }

        sort(zyun.rbegin(),zyun.rend());
        for(int i=0;i<zyun.size()-1;i++){


            if(get<0>(zyun[i+1]) < get<0>(zyun[i])){
                cout<<get<2>(zyun[i])<<",";
            }else if( get<0>(zyun[i+1])==get<0>(zyun[i])&&get<1>(zyun[i])>get<1>(zyun[i+1])){
                    cout<<get<2>(zyun[i])<<",";
            }else{
                cout<<get<2>(zyun[i])<<"=";
            }
        }
        cout<<get<2>(zyun[zyun.size()-1])<<endl;
    }






    return 0;
}

C++: #include<iostream>
#include<algorithm>

using namespace std;

#define PMAX 10
#define TMAX 50
#define INF 1000000000

int main(){

	int M,T,P,R;
	int m,t,p,j;
	int accepted[TMAX+1];
	int wrong[TMAX+1][PMAX+1];
	int sumwrong[TMAX+1];
	int time[TMAX+1];
	int rank[TMAX];

	while(1){
		cin>>M>>T>>P>>R;
		if(M==0&&T==0&&P==0&&R==0) break;

		for(int i=1;i<=TMAX;i++){
			accepted[i]=0;
			sumwrong[i]=0;
			time[i]=0;
			for(int j=1;j<=PMAX;j++){
				wrong[i][j]=0;
			}
		}

		for(int i=0;i<R;i++){
			cin>>m>>t>>p>>j;
			if(j!=0) wrong[t][p]++;
			else{
				accepted[t]++;
				time[t]+=m;
				sumwrong[t]+=wrong[t][p];
			}
		}

		for(int i=1;i<=T;i++){
			time[i]+=sumwrong[i]*20;
		}

		for(int i=0;i<T;i++){
			rank[i]=i+1;
		}

		for(int i=0;i<T;i++){
			for(int j=T-1;j>i;j--){
				if(accepted[rank[j]]>accepted[rank[j-1]]) swap(rank[j],rank[j-1]);
			}
		}
		for(int i=0;i<T;i++){
			for(int j=T-1;j>i;j--){
				if(accepted[rank[j]]==accepted[rank[j-1]]&&time[rank[j]]<time[rank[j-1]]) swap(rank[j],rank[j-1]);
			}
		}
		for(int i=0;i<T;i++){
			for(int j=T-1;j>i;j--){
				if(accepted[rank[j]]==accepted[rank[j-1]]&&time[rank[j]]==time[rank[j-1]]&&rank[j]>rank[j-1]) swap(rank[j],rank[j-1]);
			}
		}

		cout<<rank[0];
		for(int i=1;i<T;i++){
			if(accepted[rank[i]]==accepted[rank[i-1]]&&time[rank[i]]==time[rank[i-1]]) cout<<"="<<rank[i];
			else cout<<","<<rank[i];
		}
		cout<<endl;
	}

}