Jersey Distribution Problem

You are given two integers n and p representing the number of players and the number of jerseys in each pack respectively. The task is to determine whether it is possible to distribute exactly one jersey to each player by using whole packs only, without breaking any packs.

This is possible if and only if the number of players is an exact multiple of the number of jerseys per pack. In mathematical terms, the answer is "POSSIBLE" if and only if \( n \mod p = 0 \); otherwise, the answer is "IMPOSSIBLE".

inputFormat

The input consists of a single line containing two space-separated integers: n (the number of players) and p (the number of jerseys in each pack).

outputFormat

Output a single line containing either "POSSIBLE" or "IMPOSSIBLE". If distributing exactly one jersey to each player without breaking any packs is possible, print "POSSIBLE"; otherwise, print "IMPOSSIBLE".## sample

20 5

POSSIBLE