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>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <fstream>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppi;

int M,T,P,R;
int main(){
  int ms[10001];
  int ts[10001];
  int ps[10001];
  int js[10001];
  while(cin>>M>>T>>P>>R&&(M|T|P|R)){
    // waの数
    vector<pair<pii,int> > v(T);
    for(int i=0;i<T;i++)
      v[i]=make_pair(pii(0,0),i);
    int WAS[51][11]={};
    for(int i=0;i<R;i++){
      cin>>ms[i]>>ts[i]>>ps[i]>>js[i];
      ts[i]--;
      ps[i]--;
    }
    for(int i=0;i<R;i++){
      if(js[i]!=0){
        WAS[ts[i]][ps[i]]++;
      }
      else{
        v[ts[i]].first.first--;
        v[ts[i]].first.second+=WAS[ts[i]][ps[i]]*20;
        v[ts[i]].first.second+=ms[i];
      }
    }
    sort(v.begin(),v.end());
    map<pii,vector<int> > m;
    for(int i=0;i<(int)v.size();i++){
      m[v[i].first].push_back(v[i].second);
    }
    bool fst=true;
    for(map<pii,vector<int> >::iterator it=m.begin();
        it!=m.end();it++){
      if(fst)fst=false;
      else cout<<",";
      vector<int> v=it->second;
      sort(v.begin(),v.end(),greater<int>());
      for(int i=0;i<(int)v.size();i++){
        cout<<v[i]+1;
        if(i!=(int)v.size()-1)
          cout<<"=";
      }
    }
    cout<<endl;
  }
  
  return 0;
}

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

using namespace std;

struct Score{
	int team_num;
	int ac=0;
	int time=0;
	int miss_tmp[20]={0};
};

bool asc(const Score& left, const Score& right) {
	return left.ac == right.ac ? (left.time == right.time ?  left.team_num > right.team_num : left.time < right.time) :
		   left.ac > right.ac;
}

int main(){
	while(1){
		int M, T, P, R; cin>>M>>T>>P>>R;
		if(!M && !T && !P && !R) break;
		vector <Score> score(T);
		for(int i=0; i<T; i++) score[i].team_num = i;
		int m, t, p, j;
		for(int i=0; i<R; i++){
			cin>>m>>t>>p>>j;
			t=t-1;//0オリジン
			if(j == 0){
				score[t].ac++;
				score[t].time += m+(score[t].miss_tmp[p]*20);
			} else{
				score[t].miss_tmp[p]++;
			}
		}
		sort(score.begin(), score.end(), asc);
		for(int i=0; i<T; i++){
			cout << score[i].team_num+1;
			if(i!=T-1){
				if(score[i].ac == score[i+1].ac && score[i].time == score[i+1].time) cout << "=";
				else cout << ",";
			}
		}
		cout << endl;
	}
	return 0;
}

C++: #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
typedef pair<ll, int> pll;

int main()
{
  int M,T,P,R;
  while(cin>>M>>T>>P>>R,M||T||P||R) {
    int A[T+1],times[T+1],pena[T+1],miss[T+1][P+1];
    CLR(A);CLR(times);CLR(pena);CLR(miss);
    FOR(i,0,R) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      if(j==0) {
        A[t]++;
        times[t] += m;
        pena[t] += miss[t][p] * 20;
      } else {
        miss[t][p]++;
      }
    }
    vector<pll> score(T);
    FOR(i,1,T+1) {
      ll s = A[i] * (int)1e15 - pena[i] - times[i];
      score[i-1] = pll(s, i);
    }
    sort(score.rbegin(), score.rend());
    int j = 1;
    ll now = score[0].first;
    vector<vector<int> > ans(T+1);
    FOR(i,0,T) {
      if(now > score[i].first) {
        j++;
        now = score[i].first;
      }
      ans[j].push_back(score[i].second);
    }
    FOR(i,1,T+1) {
      if((int)ans[i].size() > 0) {
        if(i!=1) cout << ',';
        vector<int> pr;
        FOR(j,0,(int)ans[i].size()) {
          pr.push_back(ans[i][j]);
        }
        sort(pr.rbegin(), pr.rend());
        FOR(j,0,(int)pr.size()) {
          if(j!=0) cout<<'=';
          cout << pr[j];
        }
      }
    }
    cout << '\n';
  }
  return 0;
}