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 <vector>
#include <algorithm>

using namespace std;

struct Team {
	int tid, ac, penalty;
	Team() { tid = -1, ac = 0, penalty = 0; }
};
bool operator >(const Team& t1, const Team& t2) {
	if (t1.ac == t2.ac) {
		if (t1.penalty == t2.penalty) return t1.tid > t2.tid;
		else return t1.penalty < t2.penalty;
	}
	else return t1.ac > t2.ac;
}
bool operator ==(const Team& t1, const Team& t2) {
	return t1.ac == t2.ac && t1.penalty == t2.penalty;
}

int main() {
	int M, T, P, R;
	while ( cin >> M >> T >> P >> R, M || T || P || R ) {
		int wa[50][10] = {0};
		int ac[50][10] = {0};
		vector<Team> tdt(T);
		for (int i = 0; i < T; ++i) {
			tdt[i].tid = i+1;
			tdt[i].ac = 0;
			tdt[i].penalty = 0;
		}
		for (int i = 0; i < R; ++i) {
			int m, t, p, j; cin >> m >> t >> p >> j;
			--t, --p;
			if (j == 0) {
				if (ac[p][t] == 0) {
					++ac[p][t];
					++tdt[t].ac;
					tdt[t].penalty += m + 20 * wa[p][t];
				}
			}
			else {
				++wa[p][t];
			}
		}
		sort( tdt.begin(), tdt.end(), greater<Team>() );
		for (int i = 0; i < tdt.size(); ++i) {
			if (i) {
				if (tdt[i] == tdt[i-1]) cout << "=";
				else cout << ",";
			}
			cout << tdt[i].tid;
		}
		cout << endl;
	}
}

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

using namespace std;

struct Submit {
  int minutes, teamIdx, problemIdx, judge;
};

struct Result {
  Result() : minutes(0), judge(-1) {}
  int minutes, judge;
};

struct Score {
  Score() : teamIdx(0), acceptedCount(0), minutes(0) {}
  int teamIdx;
  int acceptedCount;
  int minutes;
};
bool operator==(const Score& lhs, const Score& rhs) {
  return lhs.acceptedCount == rhs.acceptedCount && lhs.minutes == rhs.minutes;
}

std::string calc(const std::vector<Submit>& submits, int teamCount,
                 int problemCount) {
  std::vector<std::vector<Result>> results(
      teamCount, std::vector<Result>(problemCount, Result()));
  for (auto&& submit : submits) {
    auto& result = results[submit.teamIdx - 1][submit.problemIdx - 1];
    if (submit.judge) {
      result.minutes += 20;
    } else {
      result.minutes += submit.minutes;
    }
    result.judge = submit.judge;
  }
  std::vector<Score> scores(teamCount, Score());
  for (int teamIdx = 0; teamIdx < teamCount; ++teamIdx) {
    auto& score = scores[teamIdx];
    score.teamIdx = teamIdx;
    for (int problemIdx = 0; problemIdx < problemCount; ++problemIdx) {
      const auto& result = results[teamIdx][problemIdx];
      if (result.judge) {
        continue;
      }
      score.acceptedCount++;
      score.minutes += result.minutes;
    }
  }
  std::sort(scores.begin(), scores.end(),
            [](const Score& lhs, const Score& rhs) {
              if (lhs.acceptedCount != rhs.acceptedCount) {
                return lhs.acceptedCount > rhs.acceptedCount;
              }
              if (lhs.minutes != rhs.minutes) {
                return lhs.minutes < rhs.minutes;
              }
              return lhs.teamIdx > rhs.teamIdx;
            });
  std::string ret;
  Score previousScore = Score();
  for (auto&& score : scores) {
    if (ret.length() > 0) {
      if (score == previousScore) {
        ret += "=";
      } else {
        ret += ",";
      }
    }
    ret += std::to_string(score.teamIdx + 1);
    previousScore = score;
  }
  return ret;
}

int main() {
  int maxMinute, teamCount, problemCount, submitCount;
  while (std::cin) {
    std::cin >> maxMinute >> teamCount >> problemCount >> submitCount;
    if (maxMinute == 0 && teamCount == 0 && problemCount == 0 &&
        submitCount == 0) {
      break;
    }
    std::vector<Submit> submits(submitCount, Submit());
    for (int i = 0; std::cin && i < submitCount; ++i) {
      std::cin >> submits[i].minutes;
      std::cin >> submits[i].teamIdx;
      std::cin >> submits[i].problemIdx;
      std::cin >> submits[i].judge;
    }
    auto ret = calc(submits, teamCount, problemCount);
    std::cout << ret << std::endl;
  }
  return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<cmath>
#include<functional>
#include<algorithm>
using namespace std;

struct S{
	int id,solve,pena;
	bool operator<(S a)const{
		if(solve!=a.solve)return solve>a.solve;
		if(pena!=a.pena)return pena<a.pena;
		return id>a.id;
	}
	bool operator==(S a)const{
		return solve==a.solve&&pena==a.pena;
	}
};
int main(){
	int M,T,P,R;
	S team[50];
	while(cin>>M>>T>>P>>R,M|T|P|R){
		for(int i=0;i<T;i++){
			team[i].id=i+1;
			team[i].solve=team[i].pena=0;
		}
		int wrong[50][10]={};
		for(int i=0;i<R;i++){
			int m,t,p,j;
			cin>>m>>t>>p>>j;
			t--;p--;
			if(j==0){
				team[t].solve++;
				team[t].pena += m+20*wrong[t][p];
			}else{
				wrong[t][p]++;
			}
		}
		sort(team,team+T);
		cout<<team[0].id;
		for(int i=1;i<T;i++){
			if(team[i-1]==team[i])cout<<'=';
			else cout<<',';
			cout<<team[i].id;
		}
		cout<<endl;
	}
	return 0;
}