#K13181. Team Formation Validation

    ID: 23856 Type: Default 1000ms 256MiB

Team Formation Validation

Team Formation Validation

Given three integers r, t, and e, determine whether it is possible to form exactly r teams with each team having exactly t members using e employees.

The condition to form the teams is given by the equation: \( r \times t = e \). If the equation holds true, print "Possible"; otherwise, print "Impossible".

This problem tests your ability to perform basic arithmetic operations and condition checks.

inputFormat

The input consists of a single line containing three space-separated integers: r, t, and e.

For example: 3 4 12

outputFormat

Output a single line containing either "Possible" if exactly r teams can be formed from e employees (i.e. if r*t equals e) or "Impossible" otherwise.## sample

3 4 12
Possible