object Main {
  import java.io.{BufferedReader, InputStream, InputStreamReader}
  import java.util.StringTokenizer
  import scala.reflect.ClassTag

  def main(args: Array[String]): Unit = {
    val out = new java.io.PrintWriter(System.out)
    new Main(out, new InputReader(System.in)).solve()
    out.flush()
  }

  private val oj = System.getenv("ATCODER_DEBUG") == null
  def DEBUG(f: => Unit): Unit = {
    if (!oj){ f }
  }
  def debug(as: Array[Boolean]): Unit = if (!oj){ debug(as.map(x => if(x) "1" else "0").mkString) }
  def debug(as: Array[Int]): Unit = if (!oj){ debug(as.mkString(" ")) }
  def debug(as: Array[Long]): Unit =if (!oj){ debug(as.mkString(" ")) }
  def debugDim(m: Array[Array[Long]]): Unit = if (!oj){
    REP(m.length) { i =>
      debug(m(i))
    }
  }
  def debugDimFlip(m: Array[Array[Long]]): Unit = if (!oj){
    REP(m(0).length) { j =>
      REP(m.length) { i =>
        System.err.print(m(i)(j))
        System.err.print(" ")
      }
      System.err.println()
    }
  }
  def debug(s: => String): Unit = DEBUG {
    System.err.println(s)
  }
  def debugL(num: => Long): Unit = DEBUG {
    System.err.println(num)
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = Integer.parseInt(next())
    def nextLong(): Long = java.lang.Long.parseLong(next())
    def nextChar(): Char = next().charAt(0)

    def ni(): Int = nextInt()
    def nl(): Long = nextLong()
    def nc(): Char = nextChar()
    def ns(): String = next()
    def ns(n: Int): Array[Char] = ns().toCharArray
    def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
    def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
      val A1, A2 = Array.ofDim[Int](n)
      REP(n) { i =>
        A1(i) = ni() + offset
        A2(i) = ni() + offset
      }
      (A1, A2)
    }
    def nm(n: Int, m: Int): Array[Array[Int]] = {
      val A = Array.ofDim[Int](n, m)
      REP(n) { i =>
        REP(m) { j =>
          A(i)(j) = ni()
        }
      }
      A
    }
    def nal(n: Int): Array[Long] = map(n)(_ => nl())
    def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  }

  def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }
  def TO(from: Int, to: Int)(f: Int => Unit): Unit = {
    REP(to - from + 1, from) { i =>
      f(i)
    }
  }
  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    REP(n)(i => res(i) = f(i + offset))
    res
  }

  def sumL(as: Array[Int]): Long = {
    var s = 0L
    REP(as.length)(i => s += as(i))
    s
  }
  def cumSum(as: Array[Int]): Array[Long] = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}

class Main(out: java.io.PrintWriter, sc: Main.InputReader) {
  import sc._
  import Main._
  import java.util.Arrays.sort

  import scala.collection.mutable
  import math.{abs, max, min}
  import mutable.ArrayBuffer

  // toIntとか+7とかするならvalにしろ
  @inline private def MOD = 1000000007

  case class Coord(x: Int, y: Int)
  case class Rect(x1: Int, y1: Int, x2: Int, y2: Int)

  def conv(c: Coord): Coord = {
    Coord(c.x + c.y, c.x - c.y)
  }

  def rev(c: Coord): Coord = {
    Coord((c.x + c.y)/2, (c.x-c.y)/2)
  }

  /**
    * (x, y)からK距離のひし形を正方形に変形する
    */
  def convRect(x: Int, y: Int, K: Int): Rect = {
    val cs = Seq(Coord(x, y + K), Coord(x, y - K), Coord(x + K, y), Coord(x -K, y)) map conv
    val c1 = Coord(cs.map(_.x).min, cs.map(_.y).min)
    val c2 = Coord(cs.map(_.x).max, cs.map(_.y).max)
    Rect(c1.x, c1.y, c2.x, c2.y)
  }

  def solve2(): Boolean = {
    val K = ni()
    var X, Y = ni()

    if (K % 2 == 0 && (abs(X + abs(Y)) % 2 == 1)) return false

    val moves = ArrayBuffer[(Int, Int)]()
    moves += ((X, Y))
    def move(): Unit = {
      val x = min(abs(X), K) // できるだけxで動いて
      val y = K - x  // 残りをyで動く

      if (X >= 0) X -= x else X += x
      if (Y >= 0) Y -= y else Y += y

      moves += ((X, Y))
    }

    while(abs(X) + abs(Y) > 2 * K) move()

    if ((abs(X) + abs(Y)) % 2 == 1) {
      move()
    }

    if (X != 0 || Y != 0) {
      debug(s"X:$X Y:$Y")
      val r1 = convRect(0, 0, K)
      val r2 = convRect(X, Y, K)
      val c = rev(intersection(r1, r2))
      debug(s"r1:$r1 r2:$r2 c:$c")
      moves += ((c.x, c.y))
      moves += ((0, 0))
    }

    moves.remove(moves.length - 1)
    out.println(moves.length)
    moves.reverse.foreach {
      case (x, y) => out.println(s"$x $y")
    }

    true
  }

  def intersection(r1: Rect, r2: Rect): Coord = {
    val x = if ((r2.x1 to r2.x2).contains(r1.x1)) r1.x1 else r1.x2
    val y = if ((r1.y1 to r1.y2).contains(r2.y1)) r2.y1 else r2.y2
    Coord(x, y)
  }

  def solve(): Unit = {
    if (!solve2()) out.println(-1)
  }
}