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<algorithm>
#include<map>

using namespace std;

int M,T,P,R;

class Trem {
public:

    int id;
    int AC_cnt;
    int WA_cnt[13];
    int time;
    bool is_AC[13];
    Trem() {
    }
    Trem(int i) {
        this->id = i;
        AC_cnt=0;
        time=0;
        for(int i=0;i<13;i++) {
            WA_cnt[i]=0;
            is_AC[i]=false;
        }
    }
    void submit(int m,int t,int p,int j) {
        if(j==0) {
            AC_cnt++;
            is_AC[t]=true;
            time += m;
            time += WA_cnt[t]*20;
        }
        else {
            WA_cnt[t]++;
            
        }
    }
    bool operator<(const Trem& t1) const {
        if(this->AC_cnt == t1.AC_cnt) {
            if(this->time == t1.time) return this->id > t1.id;
            else return this->time < t1.time;
        }
        else {
            return this->AC_cnt > t1.AC_cnt;
        }
    }

};

void solve() {
    Trem trem[53];
    for(int i=0;i<53;i++) trem[i]=Trem(i);
    for(int i=0;i<R;i++) {
        int m,t,p,j;
        cin>>m>>t>>p>>j;
        trem[t].submit(m,t,p,j);
    }
    sort(trem+1,trem+T+1);
    for(int i=1;i<=T;i++) {
        Trem t = trem[i];
        Trem next = trem[i+1];
        char c = ((t.AC_cnt==next.AC_cnt && 
                t.time == next.time)?'=':',');
        if(i==T) c='\n';
        cout<<t.id;
        cout<<(c);
    }
        cout<<endl;

    

}

int main() {
    while(cin>>M>>T>>P>>R) {
        if(M+T+P+R==0) return 0;
        solve();
    }

    return 0;
}

C++: #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
  
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
  
using namespace std;
  
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
  
const int INF=1<<29;
const double EPS=1e-9;
  
const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};

struct Log {
  int m, t, p, j;
};

struct Point {
  int t, ac, pena;
};

void solve(int M, int T, int P, int R, vector<Log> &L) {
  vector<vector<int>> pena(T, vector<int>(P, 0));
  vector<Point> sc(T, (Point){0, 0, 0});
  for (int i = 0; i < T; i++) {
    sc[i].t = i;
  }

  for (int i = 0; i < L.size(); i++) {
    if (L[i].j == 0) {
      sc[L[i].t].ac++;
      sc[L[i].t].pena += L[i].m + pena[L[i].t][L[i].p];
    } else {
      pena[L[i].t][L[i].p] += 20;
    }
  }

  sort(sc.begin(), sc.end(), [](Point a, Point b){
    if (a.ac == b.ac) {
      if (a.pena == b.pena) {
        return a.t > b.t;
      } else {
        return a.pena < b.pena;
      }
    } else {
      return a.ac > b.ac;
    }
  });

  for (int i = 0; i < T; i++) {
    cout << sc[i].t + 1;
    if (i != T - 1) {
      if (sc[i].ac == sc[i + 1].ac && sc[i].pena == sc[i + 1].pena) {
        cout << "=";
      } else {
        cout << ",";
      }
    }
  }
  cout << endl;
}


int main() {
  int M, T, P, R;

  while(cin >> M >> T >> P >> R, M) {
    vector<Log> L;
    for (int i = 0; i < R; i++) {
      int m, t, p, j;
      cin >> m >> t >> p >> j;
      t--, p--;
      L.push_back((Log){m, t, p, j});
    }
    solve(M, T, P, R, L);

  }
  return 0;
}

C++: #include <iostream>
#include <queue>
#include <tuple>
#include <map>
#include <set>

using namespace std;

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

struct Team {
	int no, time;
	map<int, int> wa;
	set<int> ac;
	Team() : time(0) {}
	bool operator < (Team &other) {
		if (ac.size() == other.ac.size()) {
			if (time == other.time) {
				return no < other.no;
			}
			return time > other.time;
		}
		return ac.size() < other.ac.size();
	}
	bool operator == (Team &other) {
		return ac.size() == other.ac.size() && time == other.time;
	}
};

int main() {
	int M, T, P, R;
	while (cin >> M >> T >> P >> R && M) {
		vector<Team> teams(T);
		rep(i, T) {
			teams[i].no = i + 1;
		}
		rep(i, R) {
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			t--;
			if (j == 0) {
				teams[t].time += teams[t].wa[p] * 20 + m;
				teams[t].ac.insert(p);
			}
			else {
				teams[t].wa[p]++;
			}
		}
		sort(teams.begin(), teams.end());
		reverse(teams.begin(), teams.end());
		rep(i, T-1) {
			cout << teams[i].no;
			if (teams[i] == teams[i + 1]) {
				cout << "=";
			}else{
				cout << ",";
			}
		}
		cout << teams.back().no << endl;
	}

	return 0;
}