using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }


    void swap<T>(ref T a, ref T b)
    {
        var t = a;
        a = b;
        b = t;
    }
    void solve()
    {
        int K = cin.nextint;
        var X = cin.nextint;
        var Y = cin.nextint;
        var D = Abs(X) + Abs(Y);

        if (D == K)
        {
            WriteLine(1);
            WriteLine($"{X} {Y}");
            return;
        }
        if (K % 2 == 0 && D % 2 == 1)
        {
            WriteLine(-1);
            return;
        }
        //Nを決める
        var N = (D + K - 1) / K;
        if (N == 1) N++;
        if ((K * N - D) % 2 == 1) N++;
        WriteLine(N);
        var ans = new pair[N];

        int a = X < 0 ? -1 : 1;
        int b = Y < 0 ? -1 : 1;

        X = Abs(X);
        Y = Abs(Y);
        bool rev = X < Y;
        if (rev) swap(ref X, ref Y);

        int R = (N * K - D) / 2;
        if (N == 3)
        {
            int A = R / 2;
            int B = R - A;
            for (int i = 0; i < N; i++)
            {
                int power = (i + 1) * K;
                if (power <= A)
                {
                    ans[i] = new pair(0, -power);
                }
                else if (power <= A + B + Y)
                {
                    power -= A;
                    ans[i] = new pair(-A, power);
                }
                else if (power <= 2 * A + B + X + Y)
                {
                    power -= A + B + Y;
                    ans[i] = new pair(-A + power, B + Y);
                }
                else
                {
                    power -= 2 * A + B + X + Y;
                    ans[i] = new pair(X, B + Y - power);
                }
            }
        }
        else
        {
            for (int i = 0; i < N; i++)
            {
                int power = (i + 1) * K;
                if (power <= Y + R)
                {
                    ans[i] = new pair(0, power);
                }
                else if (power <= Y + R + X)
                {
                    power -= Y + R;
                    ans[i] = new pair(power, Y + R);
                }
                else
                {
                    power -= Y + R + X;
                    ans[i] = new pair(X, Y + R - power);
                }
            }
        }

        foreach (var v in ans)
        {
            if (rev)
            {
                swap(ref v.f, ref v.s);
            }
            WriteLine($"{v.f * a} {v.s * b}");
        }
    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}


Measured memory_bytes: 27448