Potion Creation Feasibility

You are given the total available units of two types of magical essences: Dragon essence and Unicorn essence. In order to craft a potion, a fixed amount of each essence is required. Specifically, each potion requires \(E\) units of Dragon essence and \(F\) units of Unicorn essence.

Your task is to determine if it is possible to create \(P\) potions with the available resources. The conditions for a successful potion creation are given by the following formulas:

[ \text{Total Dragon essence needed} = E \times P ]

[ \text{Total Unicorn essence needed} = F \times P ]

If the available Dragon essence \(D\) is at least \(E \times P\) and the available Unicorn essence \(U\) is at least \(F \times P\), then it is POSSIBLE to create the potions. Otherwise, it is IMPOSSIBLE.

inputFormat

The input consists of a single line containing five space-separated integers:

• D: Total units of Dragon essence available.
• U: Total units of Unicorn essence available.
• E: Units of Dragon essence required per potion.
• F: Units of Unicorn essence required per potion.
• P: Number of potions to create.

You must read the input from standard input (stdin).

outputFormat

Output a single line containing POSSIBLE if it is possible to create all the potions with the available essences, or IMPOSSIBLE if it is not.

The output should be written to standard output (stdout).

## sample

10 15 2 3 4

POSSIBLE