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++: #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <map>
#include <set>
#include <list>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <iomanip>

#define SIZE 101
#define INF 100000000

using namespace std;


typedef pair<int, int> Pa;


int tim[100][100]; // t p time
bool pra[100][100];

int main()
{
	int M, T, P, R;
	
	pair<Pa, int> pa;

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

		for (int i = 0; i <= T; i++) {
			for (int j = 0; j <= P; j++) {
				tim[i][j] = 0; 
				pra[i][j] = false;
			}
		}
		vector<pair<Pa, int>> v(T + 1);

		for (int i = 0; i <= T; i++) {
			v[i].second = i;
		}

		for (int i = 0; i < R; i++) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if (j == 0) {
				v[t].first.first++;
				v[t].first.second = - m + tim[t][p];
			} else {
				tim[t][p] -= 20;
			}
		}

		sort(v.begin(),v.end());
		for (int i = T; i >= 1; i--) {
			//cout << v[i].first.first << " " << v[i].first.second << " " << v[i].second << endl;
			cout << v[i].second;
			if (i == 1) break;
			if (v[i].first.first == v[i - 1].first.first && v[i].first.second == v[i - 1].first.second)cout << "=";
			else cout << ",";
		}
		cout << endl;
		
	}
	

	return (0);
}

C++: #include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)n;++i)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(x) x.begin(),x.end()

struct team {
    int id, pro, tm;
    team(int id, int pro, int tm) : id(id), pro(pro), tm(tm) {}
    bool operator < (const team& a) const {
	if (pro != a.pro) { return pro < a.pro; }
	if (tm != a.tm) { return tm > a.tm; }
	if (id != a.id) { return id < a.id; }
    }
};

vector<team> vec;

int M, T, P, R;
int pn[50][10];
int ac[50][10];

int main() {
    while (scanf("%d %d %d %d", &M, &T, &P, &R), M) {
	vec.clear();
	memset(pn, 0, sizeof(pn));
	memset(ac, 0, sizeof(ac));

	rep(i, R) {
	    int m, t, p, j;
	    scanf("%d %d %d %d", &m, &t, &p, &j);
	    --t; --p;
	    if (j) ++pn[t][p];
	    else ac[t][p] = m;
	}

	rep(i, T) {
	    int sol = 0, tm = 0;
	    rep(j, P) {
		if (!ac[i][j]) continue;
		++sol;
		tm += ac[i][j] + pn[i][j] * 20;
	    }
	    vec.push_back(team(i + 1, sol, tm));
	}

	sort(ALL(vec));
	reverse(ALL(vec));

	int i;
	for (i = 0; i < T; ++i) {
	    if (i) printf(",");
	    team &tt = vec[i];
	    int j = i;

	    while (j + 1 < T && vec[j + 1].pro == vec[i].pro && vec[j + 1].tm == vec[i].tm) ++j;

	    for (int k = i; k <= j; ++k) {
		if (k != i) printf("=");
		printf("%d", vec[k].id);
	    }
	    i = j;
	}
	puts("");
    }
    return 0;
}

C++: #include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>

using namespace std;

#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef complex<int> P;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;
const double EPS = 1e-10;
const double PI = acos(-1.0);



const int n = 151;
vector<vector<int>> a(n, vector<int>(n));

void init(){
	for(int i=1;i<n;++i) for(int j=i+1;j<n;++j){
		a[i][j] = i * i + j * j;
	}
}

bool solve(){
	int h, w;
	cin>> h>> w;
	if(!h && !w) return false;

	int x = h * h + w * w;
	pii ans(n, n);
	for(int i=1;i<n;++i){
		for(int j=i+1;j<n;++j){
			int y = i * i + j * j;
			if((i <= h && y == x) || y < x) continue;
			if(y < ans.first * ans.first + ans.second * ans.second){
				ans = pii(i, j);
			}
		}
	}
	cout<< ans.first<< " "<< ans.second<< endl;
	return true;
}

int main(){
	cout.setf(ios::fixed); cout.precision(10);
	init();
	while(solve());
	return 0;
}