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>
#define N 2001
using namespace std;
struct team{
  int tnum;
  int correct;
  int time;
};
int main(){
  int m,t,p,r,im[N],it[N],ip[N],ij[N],incorrect,i,j;
  struct team data[51];
  while(1){
    cin >> m >> t >> p >> r;
    if(m==0&&t==0&&p==0&&r==0) break;
    for(i=0;i<r;i++) cin >> im[i] >> it[i] >> ip[i] >> ij[i];
    for(i=1;i<=t;i++){
      data[i].tnum=i;
      data[i].correct=0;
      data[i].time=0;
    }
    for(i=0;i<r;i++){
      if(ij[i]==0){
	data[it[i]].correct++;
      	incorrect=0;
	for(j=0;j<i;j++){
	  if(it[i]==it[j]&&ip[i]==ip[j]) incorrect++;
	}
	data[it[i]].time=data[it[i]].time+incorrect*20+im[i];
      }
    }
    for(i=1;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].tnum>data[j-1].tnum) swap(data[j],data[j-1]);
      }
    }
    for(i=1;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].time<data[j-1].time) swap(data[j],data[j-1]);
      }
    }
    for(i=1;i<=t;i++){
      for(j=2;j<=t;j++){
	if(data[j].correct>data[j-1].correct) swap(data[j],data[j-1]);
      }
    }
    for(i=1;i<t;i++){
      cout << data[i].tnum;
      if(data[i].correct==data[i+1].correct&&data[i].time==data[i+1].time)
	cout << '=';
      else cout << ',';
      if(i==t-1) cout << data[i+1].tnum;
    }
    cout << endl;
  }
  return 0;
}

C++: #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;

struct Team{
  int team_id=-1;
  int wa_count[11]={};
  int last_ac_time=9999;
  int penalty_time=9999;
  int result_time=999999;
  int ac_count=-1;
  bool operator==(const Team& another)const{
    return ac_count==another.ac_count&&result_time==another.result_time;
  }
};

bool Comp(const Team& a,const Team& b){
  if(a.ac_count!=b.ac_count){
    return a.ac_count>b.ac_count;
  }else if(a.result_time!=b.result_time){
    return a.result_time<b.result_time;
  }else{
    return a.team_id>b.team_id;
  }
}


void Solve(int m,int t,int p,int r){
  std::vector<Team> team(t+1);

  for(int i=1;i<=t;i++){
    team[i].team_id=i;
    team[i].last_ac_time=0;
    team[i].penalty_time=0;
    team[i].result_time=0;
    team[i].ac_count=0;
  }
  for(int i=0;i<r;i++){
    int mk,tk,pk,jk;
    cin>>mk>>tk>>pk>>jk;
    Team& tgt=team[tk];
    if(jk==0){
      //AC
      tgt.last_ac_time=mk;
      tgt.penalty_time+=tgt.wa_count[pk]*20;
      tgt.ac_count++;
    }else{
      //WA
      tgt.wa_count[pk]++;
    }
  }

  for(int i=1;i<=t;i++){
    team[i].result_time=team[i].penalty_time+team[i].last_ac_time;
  }

  std::sort(team.begin(),team.end(),Comp);

  for(int i=0;i<t-1;i++){
    if(team[i]==team[i+1]){
      cout<<team[i].team_id<<"=";
    }else{
      cout<<team[i].team_id<<",";
    }
  }
  cout<<team[t-1].team_id<<endl;


}



int main(void) {
  cout << std::fixed << std::setprecision(10);
  cin.tie(0);
  std::ios::sync_with_stdio(false);


  while(true){
    int m,t,p,r;
    cin>>m>>t>>p>>r;
    if(m==0&&t==0&&p==0&&r==0){
      break;
    }
    Solve(m,t,p,r);

  }




  return 0;
}

C++: #include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

class team {
public:
  int num;
  int time;
  int solveNum;
  int p[10];
  bool j[10];
  int probTime[10];
  team(int a, int b, int c) {
    num = a;
    time = b;
    solveNum = c;
    for (int i = 0; i < 10; i++) {
      p[i] = 0;
      j[i] = false;
      probTime[i] = 0;
    }
  }
};

bool compare(team a, team b) {
  return (a.solveNum > b.solveNum ||
	  (a.solveNum == b.solveNum && a.time < b.time) ||
	  (a.solveNum == b.solveNum && a.time == b.time && a.num > b.num));
}

bool tie(team a, team b) {
  return (a.solveNum == b.solveNum && a.time == b.time);
}

int main() {
  int M, T, P, R;
  while(true) {
    cin >> M >> T >> P >> R;
    if (M == 0 && T == 0 && P == 0 && R == 0) break;

    vector <team> myTeam;
    for (int i = 0; i < T; i++) {
      myTeam.push_back(team(i+1, 0, 0));
    }

    for (int i = 0; i < R; i++) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      myTeam[t-1].probTime[p-1] = m;
      if (j == 0) {
	myTeam[t-1].solveNum++;
	myTeam[t-1].time += myTeam[t-1].probTime[p-1]+ myTeam[t-1].p[p-1]*20;
      }else {
	myTeam[t-1].p[p-1]++;
      }
    }
    //    for (int i = 0; i < R; i++) {
      //      for (int j = 0; j < 10; j++) {
    //	if (!myTeam[i].j[j]) {
    //	  myTeam[i].time -= myTeam[i].probTime[j-1];
    //	}
    //      }
    //    }

    sort(myTeam.begin(), myTeam.end(), compare);
    for (int i = 0; i < T-1; i++) {
      std::cout << myTeam[i].num;
      if (tie(myTeam[i], myTeam[i+1])) {
	std::cout << "=";
      }else {
	std::cout << ",";
      }
    }
    std::cout << myTeam[T-1].num << std::endl;

  }
}