#include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>

// using
using namespace std;

// typedef
typedef long long ll;

// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#define REP(i, n) FOR(i, 0, n, 1)
#define RFOR(i, a, b, c) for (int i = (int)(a); i >= (int)(b); i -= (int)(c))
#define RREP(i, n) RFOR(i, n, 0, 1)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERSE(c) reverse(ALL(c))
#define UNIQ(c) unique(ALL(c))
#define LB(c, x) lower_bound(c.begin(), c.end(), x)
#define UB(c, x) upper_bound(c.begin(), c.end(), x)
#define LI(c, x) distance(c.begin(), LB(c, x))
#define UI(c, x) distance(c.begin(), UB(c, x))

// functions
template <class T> T ceil(T a, T b) {
    return (a + b - 1) / b;
}
template <class T> T round(T a, T b) {
    return (a + b / 2) / b;
}
template <class T> T gcd(T a, T b) {
    return b ? gcd(b, a % b) : a;
}
template <class T> T lcm(T a, T b) {
    return a / gcd(a, b) * b;
}
template <class T> bool amax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool amin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
ll modpow(ll a, ll b, ll m) {
    if (b == 0) {
        return 1;
    } else if (b % 2 == 0) {
        ll h = modpow(a, b / 2, m);
        return h * h % m;
    } else {
        return a * modpow(a, b - 1, m) % m;
    }
}
ll comb(ll a, ll b, ll m) {
    if (b > a - b) {
        return comb(a, a - b, m);
    }
    ll c = 1, d = 1;
    REP(i, b) {
        c *= (a - i);
        d *= (b - i);
        c %= m;
        d %= m;
    }
    return c * modpow(d, m - 2, m) % m;
}

// main
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int K, X, Y;
    cin >> K >> X >> Y;

    int xcoef = 1, ycoef = 1;
    bool f = false;
    if (X < 0) {
        X *= -1;
        xcoef = -1;
    }
    if (Y < 0) {
        Y *= -1;
        ycoef = -1;
    }
    if (X > Y) {
        swap(X, Y);
        f = true;
    }

    int S = X + Y;
    int c = (K - S % K) % K;
    int N;
    vector<pair<int, int>> ps;
    if (K % 2 == 0 && (X + Y) % 2 == 1) {
        N = -1;
    } else if (S < K && S % 2 == 1) {
        N = 3;
        int d = (K - S) / 2;
        ps.push_back(make_pair(1 - K, -1));
        ps.push_back(make_pair(-Y - d, Y + d));
        ps.push_back(make_pair(X, Y));
    } else {
        if (S < K) {
            N = 2;
        } else if (c % 2 == 0) {
            N = ceil(S, K);
        } else {
            N = ceil(S, K) + 1;
        }
        int x = 0, y = 0;
        int d = (N * K - S) / 2;
        FOR(i, 1, N + 1, 1) {
            int l = i * K;
            if (l <= X + d) {
                ps.push_back(make_pair(l, 0));
            } else if (l <= X + d + Y) {
                ps.push_back(make_pair(X + d, l - X - d));
            } else {
                ps.push_back(make_pair(X + (N - i) * K, Y));
            }
        }
    }

    cout << N << endl;
    for (auto p : ps) {
        int x = p.first, y = p.second;
        if (f) {
            swap(x, y);
        }
        cout << x * xcoef << " " << y * ycoef << endl;
    }
    return 0;
}


Measured memory_bytes: 3952