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 <map>
#include <algorithm>
#include <utility>
#include <cmath>
using P = std::pair<int, int>;
using namespace std;

struct team_data {
    int team_num = -1;
    int solved_num = 0;
    int sum_time = 0;    // minute
    //vector<int> solved_time;
    vector<int> penalty;
};

int main() {
    int M, T, P, R;
    while(cin >> M >> T >> P >> R, M) {
        vector<team_data> v(T);
        for(int i=0; i<v.size(); ++i) {
            v[i].team_num = i+1;
            v[i].penalty.resize(P);
        }
        for(int i=0; i<R; ++i) {
            int m, t, p, j;
            cin >> m >> t >> p >> j;
            if(j != 0) {
                v[t-1].penalty[p-1] += 20;
            } else {
                v[t-1].sum_time += m;
                v[t-1].solved_num += 1;
                v[t-1].sum_time += v[t-1].penalty[p-1];
            }
        }
        vector<vector<team_data>> v2(P);
        for(auto& x : v) {
            v2[x.solved_num].push_back(x);
        }
        for(auto& x : v2) {
            sort(x.begin(), x.end(), [](team_data const& t1, team_data const& t2) {
                    return t1.team_num > t2.team_num;
                    });
            stable_sort(x.begin(), x.end(), [](team_data const& t1, team_data const& t2) {
                    return t1.sum_time < t2.sum_time;
                    });
        }
        vector<team_data> ret;
        for(int i=v2.size()-1; i>=0; --i) {
            for(auto& x2 : v2[i]) {
                ret.push_back(x2);
            }
        }
        for(int i=0; i<ret.size(); ++i) {
            if(i != 0) {
                if(ret[i-1].solved_num == ret[i].solved_num) {
                    if(ret[i-1].sum_time == ret[i].sum_time) cout << '=';
                    else cout << ',';
                } else {
                    cout << ',';
                }
            }
            cout << ret[i].team_num;
        }
        cout << endl;
    }
}

C++: //
//  1187.cpp
//  
//
//  Created by Minote Tomoki on 2015/06/04.
//
//

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef struct {
    int m;
    int t;
    int p;
    int j;
} data;

typedef struct {
    int team;
    int time;
    int collect;
} status;

status judge(vector<data> team,int num) {
    int que_time[10]={0};
    
     status result = {num};
    
    for(auto k:team) {
//        que_time[k.p-1]+=k.m;
        if(k.j==0) {
            result.collect++;
            result.time+=k.m + que_time[k.p-1];
        }
        else {
            que_time[k.p-1]+=20;
        }
        
    }
//    cout << result.time << endl;
//    cout << result.collect << endl;
    
    cout << result.time << endl;
    
    return result;
}

bool cmp(const status& left, const status& right) {
    if ( left.collect == right.collect) {
        if(left.time == right.time) {
            return left.team > right.team;
        }
        else {
            return left.time < right.time;
        }
    }
    return left.collect > right.collect;
}

bool eq(const status& left, const status& right) {
    if(left.collect == right.collect && left.time == right.time) return true;
    else return false;
}

int main(void) {
    int M,T,P,R;
    int m,t,p,j;
    
    while(cin >> M >> T >> P >> R, M|T|P|R) {
    
        vector<data> dat(R);
        vector<vector<data>> team(T);
        vector<status> result;
    
        for(int i=0;i<R;i++) {
            cin >> m >> t >> p >> j;
            data d={m,t,p,j};
            team[t-1].push_back(d);
        }
    
        int k=1;
        for(auto i:team){
            status tmp = judge(i,k++);
            result.push_back(tmp);
            //cout << tmp.time << "," << tmp.collect << endl;
        }
        
        
        //for(int i=0;i<T;i++) { cout << result[i].collect << endl; }
        sort(result.begin(),result.end(),cmp);
        for(int i=0;i<team.size();i++){
            cout << result[i].team;
            if(i<team.size()-1) {
                if(eq(result[i],result[i+1])) cout << "=";
                else cout << ",";
            }
        }
        cout << endl;
    }
    
    return 0;
}