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; }
real readReal() { return readToken.to!real; }

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



// (P m - Q) (P n - Q) = Q^2

void main() {
  try {
    for (; ; ) {
      const P = readLong;
      const Q = readLong;
      
      long[] ds;
      for (long d = 1; d * d <= Q; ++d) if (Q % d == 0) {
        ds ~= d;
        if (d != Q / d) ds ~= Q / d;
      }
      ds.sort;
      long[] dds;
      foreach (d0; ds) foreach (d1; ds) if (d0 <= d1) {
        dds ~= d0 * d1;
      }
      dds = dds.sort.uniq.array;
      debug {
        writeln("dds = ", dds);
      }
      
      alias Entry = Tuple!(long, "m", long, "n");
      Entry[] ans;
      foreach (d; dds) {
        const e = Q * Q / d;
        if ((Q + d) % P == 0 && (Q + e) % P == 0) {
          ans ~= Entry((Q + d) / P, (Q + e) / P);
        }
      }
      ans.sort;
      
      writeln(ans.length);
      foreach (mn; ans) {
        writeln(mn.m, " ", mn.n);
      }
    }
  } catch (EOFException e) {
  }
}