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
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

struct Score{
  int c, s, p, t;
  
  Score(): c(0), s(0), p(0), t(0){}
  bool operator>(const Score& rhs) const{
	return c > rhs.c || (c == rhs.c &&
						 (s < rhs.s || (s == rhs.s && t > rhs.t)));
  }
};

bool eq(Score& s1, Score& s2){
  return s1.c == s2.c && s1.s == s2.s;
}

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  while(true){
	int M, T, P, R; cin >> M >> T >> P >> R; if(T == 0) break;
	int wrong[51][11];
	fill((int*)wrong, (int*)wrong+51*11, 0);
	vector<Score> sc(T);
	REP(i,T) sc[i].t = i+1;
	REP(r,R){
	  int m, tid, pid, res;
	  cin >> m >> tid >> pid >> res;
	  if(!res){
		sc[tid-1].s += m + 20 * wrong[tid-1][pid];
		++sc[tid-1].c;
	  }
	  else
		++wrong[tid-1][pid];
	}

	sort(ALL(sc), greater<Score>());
	cout << sc[0].t;
	for(int i=1;i<T;++i){
	  if(eq(sc[i-1], sc[i])) cout << "=";
	  else cout << ",";
	  cout << sc[i].t;
	}
	cout << endl;
  }
  
  return 0;
}

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

using namespace std;

struct Result {
  int time, prob, No;
  Result () {
    time = prob = No = 0;
  }
  Result (int time, int prob, int No) : time(time), prob(prob), No(No) {}
};

bool comp(const Result &r1, const Result &r2) {
  
  if (r1.prob > r2.prob) {
    return true;
  } else if (r1.prob == r2.prob) {
    if (r1.time < r2.time) {
      return true;
    } else if (r1.time < r2.time) {
      return true;
    } else {
      return r1.No > r2.No;
    }
  } else {
    return false;
  }
  /*
  if (r1.prob == r2.prob) return r1.time < r2.time; 
  return r1.prob > r2.prob;
  */
}

int M, T, P, R, m, t, p, j, penalty[51][11];
Result r[51];

int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);

  while (cin >> M >> T >> P >> R, M | T | P | R) {
    memset(penalty, 0, sizeof(penalty));
    for (int i = 0; i < T; ++i) r[i] = Result(0, 0, i);
    for (int i = 0; i < R; ++i) {
      cin >> m >> t >> p >> j;

      if (j == 0) {
        r[t-1].prob++;
        r[t-1].time += m + penalty[t-1][p-1];
      }
      else {
        penalty[t-1][p-1] += 20;
      }
    }
    /*cerr << "==========" << endl;
    for (int i = 0; i < T; ++i) cout << r[i].No + 1<< " " << r[i].time << " " << r[i].prob << endl;
    */
    
    sort(r, r + T, comp);

    /*cerr << "==========" << endl;
      for (int i = 0; i < T; ++i) cout << r[i].No << " " << r[i].time << " " << r[i].prob << endl;*/
    /* */
    for (int i = 0; i < T; ++i) {
      if (i == 0) {
        cout << r[i].No+1;
      }
      else {
        if (r[i-1].time == r[i].time && r[i-1].prob == r[i].prob) {
          cout << "=";
        }
        else {
          cout << ",";
        }
        cout << r[i].No+1;
      }
    }
    cout << endl;
    /* */
  }

  return 0;
}

C++: #include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;

typedef pair<int,int> pii;
typedef pair<pii,int> tri;
int main(){
  int m,t,p,r;
  int team[55][15];
  while(cin>>m>>t>>p>>r,m){
    memset(team,0,sizeof(team));
    vector<tri> ans;
    int a,b,c,d;
    for(int i=0;i<r;i++){
      cin>>a>>b>>c>>d;
      if(d!=0){
	team[b][c]++;
      }else{
	team[b][p+1]+=a+20*team[b][c];
	team[b][p+2]++;
      }
    }
    for(int i=1;i<=t;i++){
      ans.push_back(tri(pii(-team[i][p+2],team[i][p+1]),-i));
    }
    sort(ans.begin(),ans.end());
    for(int i=0;i<t;i++){
      cout<<-ans[i].second;
      if(i+1==t)cout<<endl;
      else if(ans[i].first == ans[i+1].first)cout<<"=";
      else cout<<",";
    }
  }
}