Problem Description

The big fish eats the small fish, and the small fish eats the shrimp.

A group of happy little fish are swimming in the ocean when they enter a small tunnel. Suddenly, an evil $FISH$ bursts out and tries to harm them. Each fish has $k$ seconds to escape (the tunnel is narrow, so only one fish can pass at a time). After $n$ seconds, the big fish arrives. Can $x$ fish escape safely? Output fish if possible, otherwise output FISH.

Please take care of the little fish. The original intent of this problem was to make programmers pay attention to data size.

Input data

There is one line in total, containing three integers: $x$, $k$, and $n$.

Example 1

10 2 20

fish

Example 2

5 3 10

FISH

Sample 1 Analysis

10 small fish took a total of 20 seconds, with 20 being less than or equal to 20.

Example 2 Analysis

Five small fish took a total of 15 seconds, and 15 is greater than 10.

Limit

Limited to $1s$ and $256MiB$.

Data Assurance

Data Scope:

• For 50% of the data: $x, k, n < \text{max int}$
• For 100% of the data: $x, k, n < \text{max long long}$