p, q = map(int, input().split())

if p == 1:
    print("Impossible")
    exit()

d = q // p
tot = d * (d + 1)
x = 240000 // tot
S = []
ud = "U"
rev = {"U": "D", "D": "U"}

X = []
l = 1
r = d
while l <= r:
    if len(X) % 2 == 0:
        X.append(r)
        r -= 1
    else:
        X.append(l)
        l += 1


for i in X:
    S.append(ud * i)
    S.append("R" * x * i)
    ud = rev[ud]
    S.append(ud * i)
for i in X[::-1]:
    S.append(ud * i)
    S.append("R" * x * i)
    ud = rev[ud]
    S.append(ud * i)

S = "".join(S)
x, y = 0, 0
XY = [(x, y)]
for s in S:
    if s == "U":
        y += 1
    elif s == "D":
        y -= 1
    elif s == "R":
        x += 1
    elif s == "L":
        x -= 1
    XY.append((x, y))


print("Possible")
print(len(XY) - 1)
for x, y in XY:
    print(x, y)