Problem:
ICPC Ranking

Your mission in this problem is to write a program
which, given the submission log of an ICPC (International Collegiate Programming Contest),
determines team rankings.

The log is a sequence of records of program submission
in the order of submission.
A record has four fields: elapsed time, team number,
problem number, and judgment.
The elapsed time is the time elapsed from the beginning of the contest
to the submission.
The judgment field tells whether the submitted program was
correct or incorrect, and when incorrect,
what kind of an error was found.

The team ranking is determined according to the following rules.
Note that the rule set shown here is one used in the real ICPC World Finals and Regionals,
with some detail rules omitted for simplification.

Teams that solved more problems are ranked higher.

Among teams that solve the same number of problems,
ones with smaller total consumed time are ranked higher.

If two or more teams solved the same number of problems, and their
total consumed times are the same, they are ranked the same.

The total consumed time is the sum of the consumed time for each problem solved.
The consumed time for a solved problem is the elapsed time
of the accepted submission plus 20 penalty minutes for every previously rejected submission for that problem.

If a team did not solve a problem, the consumed time for the problem is zero, and thus even if there are several incorrect submissions, no penalty is given.

You can assume that a team never submits a program for a problem
after the correct submission for the same problem.

Input

The input is a sequence of datasets each in the following format.
The last dataset is followed by a line with four zeros.

M T P R

m1 t1 p1 j1

m2 t2 p2 j2

.....

mR tR pR jR

The first line of a dataset contains four integers
M, T, P, and R.
M is the duration of the contest.
T is the number of teams.
P is the number of problems.
R is the number of submission records.
The relations
120 ≤ M ≤ 300,
1 ≤ T ≤ 50,
1 ≤ P ≤ 10,
and 0 ≤ R ≤ 2000
hold for these values.
Each team is assigned a team number between 1 and T, inclusive.
Each problem is assigned a problem number between 1 and P, inclusive.

Each of the following R lines contains a submission record
with four integers
mk, tk,
pk, and jk
(1 ≤ k ≤ R).
mk is the elapsed time.
tk is the team number.
pk is the problem number.
jk is the judgment
(0 means correct, and other values mean incorrect).
The relations
0 ≤ mk ≤ M−1,
1 ≤ tk ≤ T,
1 ≤ pk ≤ P,
and 0 ≤ jk ≤ 10
hold for these values.

The elapsed time fields are rounded off to the nearest minute.

Submission records are given in the order of submission.
Therefore, if i < j,
the i-th submission is done before the j-th submission
(mi ≤ mj).
In some cases, you can determine the ranking of two teams
with a difference less than a minute, by using this fact.
However, such a fact is never used in the team ranking.
Teams are ranked only using time information in minutes.

Output

For each dataset, your program should output team numbers (from 1 to T),
higher ranked teams first.
The separator between two team numbers should be a comma.
When two teams are ranked the same, the separator between them
should be an equal sign.
Teams ranked the same should be listed
in decreasing order of their team numbers.

Sample Input

300 10 8 5
50 5 2 1
70 5 2 0
75 1 1 0
100 3 1 0
150 3 2 0
240 5 5 7
50 1 1 0
60 2 2 0
70 2 3 0
90 1 3 0
120 3 5 0
140 4 1 0
150 2 4 1
180 3 5 4
15 2 2 1
20 2 2 1
25 2 2 0
60 1 1 0
120 5 5 4
15 5 4 1
20 5 4 0
40 1 1 0
40 2 2 0
120 2 3 4
30 1 1 0
40 2 1 0
50 2 2 0
60 1 2 0
120 3 3 2
0 1 1 0
1 2 2 0
300 5 8 0
0 0 0 0

Output for the Sample Input

3,1,5,10=9=8=7=6=4=2
2,1,3,4,5
1,2,3
5=2=1,4=3
2=1
1,2,3
5=4=3=2=1

Solution in JAVA (judge verdict: Accepted)

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Main {
  Scanner sc;

  class Pair<T extends Comparable<T>, U extends Comparable<U>> implements
      Comparable<Pair<T, U>> {
    T f;
    U s;
    int retro_f;
    int retro_s;

    Pair(T f_, U s_, boolean retro_ff, boolean retro_sf) {
      f = f_;
      s = s_;
      retro_f = retro_ff ? -1 : 1;
      retro_s = retro_sf ? -1 : 1;
    }

    Pair(T f_, U s_) {
      this( f_, s_, false, false );
    }

    @Override
    public int compareTo(Pair<T, U> o) {
      if ( f.compareTo( o.f ) == 0 ) {
        if ( s.compareTo( o.s ) == 0 ) {
          return 0;
        } else {
          return s.compareTo( o.s ) * retro_s;
        }
      } else {
        return f.compareTo( o.f ) * retro_f;
      }
    }

    public String toString() {
      return "{" + f.toString() + ", " + s.toString() + "}";
    }
  }

  class Team {
    ArrayList<Problem> list;

    Team() {
      list = new ArrayList<Problem>();
    }

    Pair<Integer, Integer> result() {
      int cnt = 0;
      int time = 0;
      for ( Problem v : list ) {
        if ( v.isAC ) {
          ++cnt;
          time += v.time;
          time += v.cntWA * 20;
        }
      }

      return new Pair<Integer, Integer>( cnt, time, true, false );
    }
  }

  class Problem {
    boolean isAC;
    int cntWA;
    int time;

    Problem() {
      isAC = false;
      cntWA = 0;
      time = 0;
    }
  }

  void run() {
    for ( ;; ) {
      int M = ni();
      int T = ni();
      int P = ni();
      int R = ni();

      if ( ( M | T | P | R ) == 0 ) {
        break;
      }

      ArrayList<Team> list = new ArrayList<Team>();
      for ( int i = 0; i < T; ++i ) {
        Team t = new Team();
        for ( int j = 0; j < P; ++j ) {
          Problem p = new Problem();
          t.list.add( p );
        }
        list.add( t );
      }
      for ( int i = 0; i < R; ++i ) {
        int m = ni();
        int t = ni();
        int p = ni();
        int j = ni();

        Team team = list.get( t - 1 );
        Problem prob = team.list.get( p - 1 );
        if ( j == 0 ) {
          prob.isAC = true;
          prob.time = m;
        } else {
          ++prob.cntWA;
        }
        // debug( prob.isAC, prob.time, prob.cntWA );
      }

      ArrayList<Pair<Pair<Integer, Integer>, Integer>> ansl = new ArrayList<Pair<Pair<Integer, Integer>, Integer>>();
      for ( int i = 0; i < list.size(); ++i ) {
        Team v = list.get( i );
        ansl.add( new Pair<Pair<Integer, Integer>, Integer>( v.result(), i,
            false, true ) );
      }
      // debug( ansl );

      Collections.sort( ansl );
      // debug( ansl );

      Pair<Pair<Integer, Integer>, Integer> buf = null;
      for ( int i = 0; i < ansl.size(); ++i ) {
        Pair<Pair<Integer, Integer>, Integer> v = ansl.get( i );
        if ( i > 0 ) {
          if ( v.f.compareTo( buf.f ) == 0 ) {
            System.out.print( "=" );
          } else {
            System.out.print( "," );
          }
        }
        System.out.print( v.s + 1 );
        buf = v;
      }
      System.out.println();
    }
  }

  Main() {
    sc = new Scanner( System.in );
  }

  int ni() {
    return sc.nextInt();
  }

  public static void main(String[] args) {
    new Main().run();
  }

  void debug(Object... os) {
    System.err.println( Arrays.deepToString( os ) );
  }
}