#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

//改造
typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//ここから編集する
class Solve {
public:
    void solve() {
        Int K;
        Int X, Y;
        cin >> K >> X >> Y;
        Int mX = 1, mY = 1;
        if (X < 0) {
            mX *= -1;
            X *= -1;
        }
        if (Y < 0) {
            mY *= -1;
            Y *= -1;
        }

        if (K % 2 == 0 && abs(X + Y) % 2 == 1) {
            cout << -1 << endl;
            return;
        }

        Int x = 0, y = 0;
        vector<pair<Int, Int>> ans;
        auto add_ans = [&](Int dx, Int dy) {
            if (abs(dx) + abs(dy) != K) {
                exit(-1);
            }
            x += dx;
            y += dy;
            ans.emplace_back(x, y);
        };

        while (x != X || y != Y) {
            if ((abs(X - x) + abs(Y - y)) % 2 == 0 && (abs(X - x) + abs(Y - y)) <= 2 * K) {
                for (Int dx = -K; dx <= K; ++dx) {
                    Int dy1 = K - abs(dx);
                    Int dy2 = -K + abs(dx);

                    Int nx = x + dx;
                    Int ny1 = y + dy1;
                    Int ny2 = y + dy2;
                    if (abs(X - nx) + abs(Y - ny1) == K) {
                        add_ans(dx, dy1);
                        add_ans(X - nx, Y - ny1);
                        break;
                    } else if (abs(X - nx) + abs(Y - ny2) == K) {
                        add_ans(dx, dy2);
                        add_ans(X - nx, Y - ny2);
                        break;
                    }
                }
            } else if (x + K <= X) {
                add_ans(K, 0);
            } else if (x < X) {
                Int dx = X - x;
                Int dy1 = (K - dx);
                Int dy2 = -(K - dx);
                if (abs(Y - dy1) < abs(Y - dy2)) {
                    add_ans(dx, dy1);
                } else {
                    add_ans(dx, dy2);
                }
            } else if (y + 2 * K < Y) {
                add_ans(0, K);
            } else if (y != Y) {
                if (y + K == Y) {
                    add_ans(0, K);
                } else if (y - K == Y) {
                    add_ans(0, -K);
                } else if (abs(Y) % 2 == abs(y) % 2) {
                    Int dy = (Y - y) / 2;
                    Int dx = K - abs(dy);
                    add_ans(dx, dy);
                    add_ans(-dx, dy);
                } else {
                    if (y < Y) {
                        add_ans(0, K);
                    } else if (y > Y) {
                        add_ans(0, -K);
                    }
                }
            }
        }

        cout << ans.size() << endl;
        for (auto e : ans) {
            cout << e.first * mX << " " << e.second * mY << endl;
        }


    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


Measured memory_bytes: 6000