#include <bits/stdc++.h>

using namespace std;

#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define mp make_pair
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define All(a) (a).begin(), (a).end()
#define fi first
#define se second
template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CINT(...)                                                              \
    int __VA_ARGS__;                                                           \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
#define eputs(s)                                                               \
    {                                                                          \
        cout << s << "\n";                                                     \
        exit(0);                                                               \
    }

template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using pq = priority_queue<T>;
template <typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;

typedef long long ll;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;

const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 9e18;
const ll dx[] = {1, -1, 0, 0};
const ll dy[] = {0, 0, 1, -1};

ll K, X, Y;
ll xinv = 1, yinv = 1;

ll dist() { return abs(X) + abs(Y); }

signed main() {
    cin >> K >> X >> Y;
    vector<PL> ans;
    if(X < 0) {
        X = -X;
        xinv = -1;
    }
    if(Y < 0) {
        Y = -Y;
        yinv = -1;
    }
    if(K % 2 == 0 && dist() % 2) eputs(-1);
    if(K % 2 && dist() % 2) {
        ans.emplace_back(X * xinv, Y * yinv);
        ll x = min(X, K);
        X -= x;
        ll y = K - x;
        Y -= y;
    }
    while(dist() >= 2 * K) {
        REP(j, 1 + K % 2) {
            ans.emplace_back(X * xinv, Y * yinv);
            ll res = K;
            ll x = min(X, res);
            X -= x;
            res -= x;
            ll y = min(Y, res);
            Y -= y;
            res -= y;
        }
    }
    if(dist() == K) {
        ans.emplace_back(X * xinv, Y * yinv);
    } else if(dist()) {
        ans.emplace_back(X * xinv, Y * yinv);
        if(abs(X) >= abs(Y)) {
            ll x = (abs(X) + abs(Y)) / 2;
            ll y = K - x;
            if(X > 0)
                X = x;
            else
                X = -x;
            if(Y < 0)
                Y = y;
            else
                Y = -y;
        } else {
            ll y = (abs(X) + abs(Y)) / 2;
            ll x = K - y;
            if(Y > 0)
                Y = y;
            else
                Y = -y;
            if(X < 0)
                X = x;
            else
                X = -x;
        }
        ans.emplace_back(X * xinv, Y * yinv);
    }
    reverse(All(ans));
    cout << ans.size() << "\n";
    FOREACH(x, ans) cout << x.fi << " " << x.se << "\n";
}

Measured memory_bytes: 6384