Problem Numbers Aren't Sorted by Difficulty

hy9360 tried to solve DOJ problems in problem-number order, and discovered that problem numbers are unrelated to difficulty order.

Each problem difficulty is represented by a pair consisting of a tier name and a tier number. From easiest to hardest, the tier names are

Bronze, Silver, Gold, Platinum, Diamond, Ruby.

Within the same tier name, a larger number means an easier problem: $5$ is the easiest and $1$ is the hardest. For example, Bronze $5$ is easier than Bronze $1$, and Gold $1$ is easier than Platinum $5$.

You are given $N$ problems and a threshold difficulty $(C,D)$. Print the problem numbers of all problems whose difficulty is at most $(C,D)$, meaning that they are not harder than $(C,D)$, in increasing order of difficulty.

Problems with exactly the same difficulty may be printed in any order.

The input is given from Standard Input in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$ $\vdots$ $\mathrm{case}_T$

Each case is given in the following format:

$N\ C\ D$ $a_1\ b_1\ c_1\ d_1$ $a_2\ b_2\ c_2\ d_2$ $\vdots$ $a_N\ b_N\ c_N\ d_N$

$(C,D)$ is the threshold difficulty.

For the $i$-th problem, $a_i,b_i,c_i,d_i$ denote its problem number, problem name, tier name, and tier number, respectively.

For each test case, print the problem numbers satisfying the condition, one by one, in increasing order of difficulty. Problems with exactly the same difficulty may be printed in any order.

If no problem satisfies the condition, print -1.

• $1 \le T \le 100$.
• $1 \le N \le 385$.
• The sum of $N$ over all test cases does not exceed $2\,000$.
• Each of $C,c_i$ is one of Bronze, Silver, Gold, Platinum, Diamond, Ruby ($1 \le i \le N$).
• $1 \le D,d_i \le 5$ ($1 \le i \le N$).
• $1 \le a_i \le N$ ($1 \le i \le N$).
• $a_i \ne a_j$ ($1 \le i < j \le N$).
• $b_i$ is a string of length from $1$ to $1\,000$ consisting only of ASCII characters with codes from $33$ to $126$ ($1 \le i \le N$).
• The total length of all problem names over all test cases does not exceed $20\,000$.