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 <bits/stdc++.h>
using namespace std;

int M, T, P, R;

struct score {
  int ac;
  int time;
  int problem;
};

int main() {
  long h, w;
  while (1) {
    cin >> M >> T >> P >> R;
    if (M == 0) return 0;
    int wrong[50][10] = {0};
    vector<score> scores = vector<score>(T);
    for (int i = 0; i < R; i++) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      t--; p--;
      if (j) {
        wrong[t][p]++;
      } else {
        scores[t].ac++;
        scores[t].time += (m + 20 * wrong[t][p]);
      }
    }
    for (int i = 0; i < T; i++) {
      scores[i].problem = i + 1;
    }
    // for (int i = 0; i < T; i++) {
    //   cout << scores[i].problem << ": " <<scores[i].ac << ' ' << scores[i].time << endl;
    // }
    sort(scores.begin(), scores.end(), [](score a, score b){
      return a.ac > b.ac || (a.ac == b.ac && a.time < b.time) || (a.ac == b.ac && a.time == b.time && a.problem > b.problem);
    });
    for (int i = 0; i < T; i++) {
      if (i != 0) {
        if (scores[i].ac == scores[i-1].ac && scores[i].time == scores[i-1].time) {
          cout << '=';
        } else {
          cout << ',';
        }
      }
      cout << scores[i].problem;
    }
    cout << endl;
  }
}

C++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>

using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
#define SORT(v) sort((v).begin(),(v).end())
//#define scanf scanf_s

int ice[100005];

struct record
{
	int ac, pe, t;
};
bool comp(const record&  r1, const record& r2)
{
	if (r1.ac != r2.ac) return r1.ac > r2.ac;
	else if(r1.pe!=r2.pe) return r1.pe < r2.pe;
	else return r1.t>r2.t;
}

int main()
{
	int m, t, p, r;
	while (cin >> m >> t >> p >> r, (m || t || p || r))
	{
		int rec[55][11][2] = {};
		bool solved[55][11] = {};
		int a, b, c, d;
		REP(i, r)
		{
			cin >> a >> b >> c >> d;
			if (d == 0)
			{
				rec[b][c][0] = rec[b][c][1] + a;
				solved[b][c] = true;
			}
			else rec[b][c][1] += 20;
		}

		vector<record> v;
		FOR(i,1, t+1)
		{
			int ac = 0;
			int pe = 0;
			FOR(j,1, p+1)
			{
				if (solved[i][j] == true) ac++;
				pe += rec[i][j][0];
			}
			record r = { ac, pe, i };
			v.push_back(r);
		}

		sort(v.begin(), v.end(), comp);
		
		REP(i, v.size())
		{
			cout << v[i].t;
			if (i == v.size() - 1) cout << endl;
			else if (v[i].ac == v[i + 1].ac&&v[i].pe == v[i + 1].pe)cout << "=";
			else cout << ",";
		}

	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<vector>
#include<tuple>
#include<set>
#include<map>
#include<algorithm>
using namespace std;

struct Record {
  int tid, pid, time;
  bool correct;
};

struct Team {
  Team() {
    penalty = 0;
  }
  set<int> solved;
  map<int, int> WA;
  int penalty;
};

// Solved Problems, Penalty, Team ID
typedef tuple<int, int, int> Score;

int main() {
  int M, T, P, R;
  while (cin >> M >> T >> P >> R && M) {
    vector<Record> records(R);
    for (int i = 0; i < R; i++) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      records[i].pid = --p;
      records[i].tid = --t;
      records[i].time = m;
      records[i].correct = (j == 0);
    }

    vector<Team> teams(T);
    for (Record r : records) {
      if (teams[r.tid].solved.find(r.pid) != teams[r.tid].solved.end()) {
        continue;
      } else if (r.correct) {
        teams[r.tid].solved.insert(r.pid);
        teams[r.tid].penalty +=
          teams[r.tid].WA[r.pid] * 20 + r.time;
      } else {
        teams[r.tid].WA[r.pid]++;
      }
    }

    vector<Score> team_result(T);
    for (int i = 0; i < T; i++) {
      get<0>(team_result[i]) = -teams[i].solved.size();
      get<1>(team_result[i]) = teams[i].penalty;
      get<2>(team_result[i]) = -i;
    }

    sort(team_result.begin(), team_result.end());

    for (int i = 0, len = team_result.size(); i < len; i++) {
      Score s = team_result[i];
      if (i > 0) {
        Score p = team_result[i - 1];
        cout << 
          (get<0>(p) == get<0>(s) && get<1>(p) == get<1>(s)?"=":",");
      }
      cout << -get<2>(s)+1;
    }
    cout << endl;
  }
}