Problem Description

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

A happy group of small fish were swimming in the ocean when they entered a small tunnel. Suddenly, an evil fish burst out and tried to harm them. Each fish had a safe escape time of $k$ seconds (the tunnel was narrow, allowing only one fish to pass at a time). After $n$ seconds, a larger fish would come. Can $x$ fish escape safely? Output fish if possible, otherwise output FISH.

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

Input data

There is a single line 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, 20<=20.

Sample 2 Analysis

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

Limitations

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

Data Assurance

Data scope:

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

Note that $xk$ may exceed $\text{max unsigned long long}$.