#include <stdio.h>
long long gcd(long long a, long long b)
{
return (b == 0 ? a : gcd(b, a % b));
}
int main()
{
int t, q;
scanf(" %d", &t);
for(q = 0; q < t; q ++)
{
long long n, pd, pg, m = 100, l = 100, g, i = 1;
bool win = false;
scanf(" %lld %lld %lld", &n, &pd, &pg);
if(pg == 0 && pd != 0)
win = false;
else
{
g = gcd(m, pd);
m /= g;
pd /= g;
g = gcd(l, pg);
l /= g;
pg /= g;
if(pg == l && pd != m)
win = false;
else if(m > n)
win = false;
else
win = true;
}
if(win == false)
printf("Case #%d: Broken\n", q + 1);
else
printf("Case #%d: Possible\n", q + 1);
}
}