Chess Tournament 2

Time limit: 1s
Memory limit: 256MB
Input:
Output:

Task

You want to organize a chess tournament in your town but given the recent developments in the chess world, you want to use some extra measures to make sure that everyone playing there is playing fairly.

Thus, you came up with a system to decide the strength of each move played by each player and in order to decide whether a player cheated or not, you decided to compute the average move strength and if it exceeded a certain threshold based on that player's initial chess rating, then you conclude that a player cheated.

More formally, you are given the data from tt chess players. For each chess player you know the number of moves they made during the contest, as well as the initial elo and the threshold you are going to use.

Based on the rules described in the statement, decide whether each player cheated or not.

Input

The first line of the input will contain tt, the number of players which played in the tournament.

The first line of each test case will contain n\text{n}, elo\text{elo} and threshold\text{threshold}, representing the number of moves the ithi^{th} player made during the tournament, the initial rating the player had and the threshold you are going to use for this player.

The second line of each test case will contain nn values, representing the strengths of the moves the player did.

Output

The output f will contain for each player a message, namely "Cheater" if the player cheated or "Innocent" otherwise (without the quoting marks).

Restrictions

  • 1t1001 \leq t \leq 100
  • 1n,threshold1 0001 \leq n, threshold \leq 1 \ 000
  • 1elo3 5001 \leq elo \leq 3 \ 500
  • 1strength[i]5 0001 \leq strength[i] \leq 5 \ 000

Example

stdin

3
5 800 400
900 1000 1500 1300 1400
8 1000 200
950 800 1000 1100 1200 845 100 924
6 2500 400
1900 2100 950 2500 2000 3000

stdout

Cheater
Innocent
Innocent

Explanation

The first player's move strength is 61006100 / 55 = 12201220, which is greater than 12001200, the maximum threshold allowed.

The other two players have not cheated, thus they are innocent.

Problem info

ID: 301

Editor: Dap

Author:

Source: IIOT 2022-23 Round I

Tags:

IIOT 2022-23 Round I

Log in or sign up to be able to send submissions!