using System;
using System.Linq;
using System.Collections.Generic;
using System.Diagnostics;
using Debug = System.Diagnostics.Trace;
using SB = System.Text.StringBuilder;
using System.Numerics;
using static System.Math;
using Number = System.Int32;
using CompLib.Strings;
namespace Program {
	public class Solver {
		Random rnd = new Random();
		public void Solve() {
			var K = rl;
			var PX = rl;
			var PY = rl;
			var cX = 1;
			var cY = 1;
			if (PX < 0) { cX *= -1; PX *= -1; }
			if (PY < 0) { cY *= -1; PY *= -1; }
			Debug.WriteLine($"{PX} {PY}");
			if (PX + PY == K) {
				Console.WriteLine(1);
				Console.WriteLine($"{PX * cX} {PY * cY}");
				return;
			}
			else if (K % 2 == 0 && (PX + PY) % 2 == 1) {
				Console.WriteLine(-1);
				return;
			}
			for (int i = 2; ; i++) {
				if ((K * i) % 2 != (PX + PY) % 2) continue;
				if (K * i < PX + PY) continue;
				Console.WriteLine(i);
				if (i % 2 == 1) {
					long px, py, k;
					if (PX + PY < K) {
						py = 0; k = K; px = -K + (PX + PY);
						px *= -1; PX *= -1; cX *= -1;
					}
					else {
						var mi = Min(K, PX);
						px = PX - mi; k = K - mi;
						py = PY - k;
					}
					Debug.WriteLine($"{px} {py}");
					solve(px, py, cX, cY, K, i - 1);
					Console.WriteLine($"{PX * cX} {PY * cY}");
				}
				else {
					solve(PX, PY, cX, cY, K, i);
				}
				return;
			}
		}
		void solve(long PX, long PY, int cX, int cY, long K, int i) {
			Debug.WriteLine($"{PX} {PY} {cX} {cY} {K} {i}");
			//2*D+X+Y == Ki
			var D = (K * i - Abs(PX + PY)) / 2;
			Debug.WriteLine(D);
			long px, py;
			if (PX >= PY) {
				px = 2 * (K - D);
				py = 0;
				Debug.WriteLine("po");
				Console.WriteLine($"{(K - D) * cX} {-D * cY}");
				if (PX < 2 * (K - D)) {
					px = PX;
					py = -D + K - (PX - (K - D));
				}
				Console.WriteLine($"{px * cX} {py * cY}");
			}
			else {
				py = 2 * (K - D);
				px = 0;
				Debug.WriteLine("pi");
				Console.WriteLine($"{-D * cX} {(K - D) * cY}");
				Debug.WriteLine(PY);
				Debug.WriteLine(2 * (K - D));
				if (PY < 2 * (K - D)) {
					py = PY;
					px = -D + K - (PY - (K - D));
					Debug.WriteLine(px);
					Debug.WriteLine(py);
				}
				Console.WriteLine($"{px * cX} {py * cY}");
			}
			while (px < PX) {
				var mi = Min(PX - px, K);
				px += mi; py += K - mi;
				Console.WriteLine($"{px * cX} {py * cY}");
			}
			while (py < PY) {
				py += K;
				Console.WriteLine($"{px * cX} {py * cY}");
			}
		}

		const long INF = 1L << 60;
		static int[] dx = { -1, 0, 1, 0 };
		static int[] dy = { 0, 1, 0, -1 };
		int ri { get { return sc.Integer(); } }
		long rl { get { return sc.Long(); } }
		double rd { get { return sc.Double(); } }
		string rs { get { return sc.Scan(); } }
		public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

		static T[] Enumerate<T>(int n, Func<int, T> f) {
			var a = new T[n];
			for (int i = 0; i < a.Length; ++i) a[i] = f(i);
			return a;
		}
		static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
	}
}

#region main
static class Ex {
	static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
	static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
		return string.Join(st, ie);
	}
	static public void Main() {
		Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
		var solver = new Program.Solver();
		//var t = new System.Threading.Thread(solver.Solve, 50000000);
		//t.Start();
		//t.Join();
		solver.Solve();
		Console.Out.Flush();
	}
}
#endregion
#region Ex
namespace Program.IO {
	using System.IO;
	using System.Text;
	using System.Globalization;

	public class Printer : StreamWriter {
		public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
		public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
	}

	public class StreamScanner {
		public StreamScanner(Stream stream) { str = stream; }

		public readonly Stream str;
		private readonly byte[] buf = new byte[1024];
		private int len, ptr;
		public bool isEof = false;
		public bool IsEndOfStream { get { return isEof; } }

		private byte read() {
			if (isEof) return 0;
			if (ptr >= len) {
				ptr = 0;
				if ((len = str.Read(buf, 0, 1024)) <= 0) {
					isEof = true;
					return 0;
				}
			}
			return buf[ptr++];
		}

		public char Char() {
			byte b = 0;
			do b = read(); while ((b < 33 || 126 < b) && !isEof);
			return (char)b;
		}
		public string Scan() {
			var sb = new StringBuilder();
			for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
			return sb.ToString();
		}
		public string ScanLine() {
			var sb = new StringBuilder();
			for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
			return sb.ToString();
		}
		public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
		public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
		public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
	}
}

#endregion


namespace CompLib.Strings {
	#region Z algorithm
	static public partial class stringEx {
		/// <summary> <paramref name="s"/> と <paramref name="s"/>[i:] の最長共通接頭辞を O(|<paramref name="s"/>|) で求める。</summary>
		static public int[] ZAlgorithm(string s) {
			var a = new int[s.Length + 1];
			a[0] = s.Length;
			int i = 1, j = 0;
			while (i < s.Length) {
				while (i + j < s.Length && s[j] == s[i + j]) ++j;
				a[i] = j;
				if (j == 0) { ++i; continue; }
				int k = 1;
				while (i + k < s.Length && k + a[k] < j) { a[i + k] = a[k]; ++k; }
				i += k; j -= k;
			}
			return a;
		}
	}
	#endregion
}


Measured memory_bytes: 17324