import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const P = readInt; const Q = readInt; if (2 * P > Q) { // P/Q > 1/2 writeln("Possible"); writeln("6"); writeln("0 0"); writeln("0 -1"); writeln("1 -1"); writeln("1 0"); writeln("1 1"); writeln("2 1"); writeln("2 0"); } else if (3 * P > Q) { // P/Q > 1/3 /* a = (1-R)/2 b = R/2 c = (1-R)/4 d = (1+R)/4 */ const a = 2 * (Q-P); const b = 2 * P; const c = (Q-P); const d = (Q+P); debug { writefln("%s/%s %s", P, Q, [a, b, c, d]); } string s; s ~= "UU"; s ~= 'R'.repeat(a).array; s ~= "DDD"; s ~= 'R'.repeat(b).array; s ~= "UU"; s ~= 'R'.repeat(c).array; s ~= "DDD"; s ~= 'R'.repeat(d).array; s ~= "UU"; alias Pt = Tuple!(int, "x", int, "y"); Pt[] ps; { Pt p = Pt(0, 0); ps ~= p; foreach (dir; s) { final switch (dir) { case 'R': ++p.x; break; case 'L': ++p.x; break; case 'U': ++p.y; break; case 'D': --p.y; break; } ps ~= p; } } writeln("Possible"); writeln(ps.length - 1); foreach (p; ps) { writeln(p.x, " ", p.y); } } else { writeln("Impossible"); assert(false); } } } catch (EOFException e) { } }