using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;



class Myon
{
    public Myon() { }
    public static int Main()
    {
        cin = new Scanner();
        new Myon().calc();
        return 0;
    }

    static Scanner cin;

    void calc()
    {
        int K = cin.nextInt();
        int X = cin.nextInt();
        int Y = cin.nextInt();

        bool xflag = false;
        bool yflag = false;
        bool xyswap = false;

        if(X < 0)
        {
            X = -X; xflag = true;
        }
        if(Y < 0)
        {
            Y = -Y; yflag = true;
        }
        if(X < Y)
        {
            swap(ref X, ref Y);
            xyswap = true;
        }

        int[,] ans = calc2(X, Y, K);

        if(ans.Length == 0)
        {
            Console.WriteLine(-1);
            return;
        }

        if (xyswap)
        {
            for (int i = 0; i < ans.GetLength(0); i++)
            {
                swap(ref ans[i, 0], ref ans[i, 1]);
            }
        }
        if (xflag){
            for (int i = 0; i < ans.GetLength(0); i++)
            {
                ans[i, 0] = -ans[i, 0];
            }
        }
        if (yflag)
        {
            for (int i = 0; i < ans.GetLength(0); i++)
            {
                ans[i, 1] = -ans[i, 1];
            }
        }

        Console.WriteLine(ans.GetLength(0));
        for (int i = 0; i < ans.GetLength(0); i++)
        {
            Console.WriteLine(ans[i, 0] + " " + ans[i, 1]);
        }
    }

    //swap
    void swap<T>(ref T a, ref T b)
    {
        T c = a;
        a = b;
        b = c;
    } 


    //X, Y >= 0
    //X >= Y
    int[,] calc2(int X, int Y, int K)
    {
        if((X + Y) % 2 == 1 && K % 2 == 0)
        {
            return new int[0, 0];
        }

        //１回で行けるパターン
        if (X + Y == K)
        {
            int[,] ans = new int[1, 2];
            ans[0, 0] = X;
            ans[0, 1] = Y;
            return ans;
        }

        //天井関数のテクニックで、分子に（分母ー１）を足すと
        //天井関数になる
        int N = (X + Y + K - 1) / K;
        if (N <= 1) N = 2;

        if ((X + Y) % 2 != N * K % 2) N++;


        if(N == 3 && X < K)
        {
            //特殊パターン

            int[,] ans = new int[3, 2];

            ans[0, 0] = X;
            ans[0, 1] = -K + X;

            int overRight = (K + X - Y) / 2;

            ans[1, 0] = X + overRight;
            ans[1, 1] = Y - (K - overRight);

            ans[2, 0] = X;
            ans[2, 1] = Y;
            return ans;
        }
        else
        {
            //通常パターン
            //
            //「~~~|
            // |   |
            // |

            int over = (K * N - (X + Y)) / 2;

            int[,] ans = new int[N, 2];

            for (int i = 0; i < N; i++)
            {
                int dist = (i + 1) * K;
                if(dist <= Y + over)
                {
                    ans[i, 0] = 0;
                    ans[i, 1] = dist;
                }
                else if(dist <= Y + over + X)
                {
                    ans[i, 0] = dist - Y - over;
                    ans[i, 1] = Y + over;
                }
                else
                {
                    ans[i, 0] = X;
                    ans[i, 1] = Y + ((N - (i + 1)) * K);
                }
            }
            return ans;

        }


    }

    
}



class Scanner
{
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        if (i < s.Length) return s[i++];
        string st = Console.ReadLine();
        while (st == "") st = Console.ReadLine();
        s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        if (s.Length == 0) return next();
        i = 0;
        return s[i++];
    }

    public int nextInt()
    {
        return int.Parse(next());
    }
    public int[] ArrayInt(int N, int add = 0)
    {
        int[] Array = new int[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextInt() + add;
        }
        return Array;
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public long[] ArrayLong(int N, long add = 0)
    {
        long[] Array = new long[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextLong() + add;
        }
        return Array;
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }


    public double[] ArrayDouble(int N, double add = 0)
    {
        double[] Array = new double[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextDouble() + add;
        }
        return Array;
    }
}


Measured memory_bytes: 18620