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)); }



string solve(int P, int Q) {
  if (P > 1) {
    // (1/(N+1), 1/N)
    const N = Q / P;
    string s;
    foreach (i; 0 .. N) {
      // upper (N-i)
      s ~= 'U'.repeat(N-i).array;
      s ~= 'R'.repeat(N-i).array;
      s ~= 'D'.repeat(N-i).array;
      // lower (1+i)
      s ~= 'D'.repeat(1+i).array;
      s ~= 'R'.repeat(1+i).array;
      s ~= 'U'.repeat(1+i).array;
    }
    return s;
  } else {
    // ?!
    return null;
  }
}

void main() {
  try {
    for (; ; ) {
      const P = readInt;
      const Q = readInt;
      
      const s = solve(P, Q);
      if (s) {
        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");
      }
    }
  } catch (EOFException e) {
  }
}