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 <string>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>

using namespace std;

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)


#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define INF 1<<30
#define mp make_pair
#define pb push_back

#define fi first
#define se second

#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)

typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pii;

typedef long long ll;

class team{
public:
	int id;
	int clear;
	vi fail;
	int time;
	team(){
		// id=0;
		// clear=0;
		// fail = vi(10,0);
		// time=0;
	}
};

int main(){
	while(1){
		int M,T,P,R;
		int m,t,p,j;
		vector<team> tev;
		vector<pii> ap;
		cin>>M>>T>>P>>R;
		if(M==0)break;
		rep(i,T){
			team te;
			te.id=i+1;
			te.clear=0;
			te.time=0;
			rep(j,10){
				te.fail.pb(0);
			}
			tev.pb(te);
			//????????§id??????????????°??????????????????clear,time???0??§?????????
		}
		rep(i,R){
			cin>>m>>t>>p>>j;
			if(j==0){
				int time=m;
				//????????§?????£?§£??°????????????????????????????????£?§£??°??¨????????????????????????
				time += tev[t-1].fail[p-1]*20;
				tev[t-1].clear++;
				tev[t-1].time+=time;
			}else{
				//????????§???????????????????????¨????????£?§£?????°?????????
				tev[t-1].fail[p-1]++;
			}
		}
		rep(i,T){
			ap.pb(mp(tev[i].clear*100000+(90000-tev[i].time),tev[i].id));
		}
		sort(rall(ap));

		cout<<ap[0].se;
		REP(i,1,T){
			if(ap[i-1].fi==ap[i].fi) cout<<"=";
			else cout<<",";
			cout<<ap[i].se;
		}
		cout<<endl;
		// rep(i,T){
		// 	cout<<"debug clear:"<<tev[i].clear<<" time:"<<tev[i].time;
		// 	cout<<endl;
		// 	rep(j,P){
		// 		cout<<" fail:"<<tev[i].fail[j];
		// 	}
		// 	cout<<endl;
		// }

	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int m;
vector<int>p;
vector<int>s;
int maxn,minn;


int main(){
  int i,j,now=0,ni=0;
  while(1){
  cin >> m >> minn >> maxn;
  now = 0;
  if(m==0&&maxn==0&&minn==0)break;
  for(i=0;i<m;i++){
    cin >> j;
    p.push_back(j);
  }
  sort(p.begin(),p.end());
  for(i=0;i<m-1;i++)  s.push_back(p[i+1]-p[i]);
  for(i=m-minn-1;i>=m-maxn-1;i--){
    // cout << " bbb"<<s[i];
    if(s[i]>=now){
      now = s[i];
      ni = i;
      //cout <<"aaa"<< now << " "<< ni << endl;
    }
  }
  //cout <<endl<< ni << endl;
  cout << m-1-ni << endl;
  while(p.size())p.pop_back();
  while(s.size())s.pop_back();
  }
  return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;

struct st {
	int id, score, time, wrong[10];
};
int main() {
	int M, T, P, R;
	while (scanf("%d%d%d%d", &M, &T, &P, &R), M) {
		st team[50]{};
		rep(i, T)team[i].id = i + 1;
		rep(i, R) {
			int m, t, p, j; scanf("%d%d%d%d", &m, &t, &p, &j);
			t--; p--;
			if (j)team[t].wrong[p]++;
			else {
				team[t].score++;
				team[t].time += m + 20 * team[t].wrong[p];
			}
		}
		sort(team, team + T, [](st a, st b) {
			if (a.score != b.score)return a.score > b.score;
			if (a.time != b.time)return a.time < b.time;
			return a.id > b.id;
		});
		printf("%d", team[0].id);
		for (int i = 1; i < T; i++) {
			if (team[i - 1].score == team[i].score&&team[i - 1].time == team[i].time)
				printf("=");
			else printf(",");
			printf("%d", team[i].id);
		}
		printf("\n");
	}
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main() {
	int m, t, p, r;
	while (cin >> m >> t >> p >> r, m) {
		pair<pair<int, int>, pair<int, int>>log[2014];
		//time team problem result
		for (int i = 0; i < r; i++) 
			cin >> log[i].first.first >> log[i].first.second >> log[i].second.first >> log[i].second.second;
		pair<pair<int, int>, int>point[60];
		//problems penalty teamnum
		int penalty[60][15] = {};
		for (int i = 1; i <= t; i++) {
			point[i].first.first = 15;
			point[i].first.second = 0;
			point[i].second = i;
		}
		for (int i = 0; i < r; i++) {
			if (log[i].second.second) {
				//WRONG ANSWER
				penalty[log[i].first.second][log[i].second.first]++;
			}
			else{
				//ACCEPTED
				point[log[i].first.second].first.first--;
				point[log[i].first.second].first.second += penalty[log[i].first.second][log[i].second.first] * 20 + log[i].first.first;
			}
		}
		for (int i = 1; i < t; i++) {
			for (int j = i + 1; j <= t; j++) {
				if (point[i].first > point[j].first)swap(point[i], point[j]);
				else if (point[i].first == point[j].first)if (point[i].second < point[j].second)swap(point[i], point[j]);
			}
		}
		cout << point[1].second;
		for (int i = 2; i <= t; i++) {
			if (point[i].first == point[i - 1].first)cout << '=';
			else cout << ',';
			cout << point[i].second;
		}
		cout << endl;
	}
}