#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
inline int getInt() {
    int x;
    scanf("%d", &x);
    return x;
}
template <typename T>
inline istream &operator>>(istream &i, v(T) & v) {
    rep(j, sz(v)) i >> v[j];
    return i;
}
template <typename T>
string join(const v(T) & v) {
    stringstream s;
    rep(i, sz(v)) s << ' ' << v[i];
    return s.str().substr(1);
}
template <typename T>
inline ostream &operator<<(ostream &o, const v(T) & v) {
    if (sz(v))
        o << join(v);
    return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) { return i >> v.fi >> v.se; }
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) { return o << v.fi << "," << v.se; }
template <typename T>
inline ll suma(const v(T) & a) {
    ll res(0);
    for (auto &&x : a)
        res += x;
    return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame        \
    {               \
        puts("-1"); \
        return 0;   \
    }
#define yn           \
    { puts("Yes"); } \
    else {           \
        puts("No");  \
    }
const int MX = 200005;

ll f(ll x, ll y, ll k) {
    x = abs(x);
    y = abs(y);
    k *= 2;
    if ((x + y) % 2)
        return LINF;
    return dup(x + y, k) * 2;
}

ll g(ll x, ll y, ll k) {
    x = abs(x);
    y = abs(y);
    if (x > k)
        return f(x - k, y, k) + 1;
    return f(0, y - (k - x), k) + 1;
}

int main() {
    int k;
    scanf("%d", &k);
    int x, y;
    scanf("%d%d", &x, &y);
    ll ans = f(x, y, k);
    mins(ans, g(x, y, k));
    if (ans == LINF)
        dame;
    cout << ans << endl;
    vp as;
    as.eb(x, y);
    int sx = x < 0 ? -1 : 1;
    int sy = y < 0 ? -1 : 1;
    x = abs(x);
    y = abs(y);
    auto add = [&](int nx, int ny) {
        as.eb(nx * sx, ny * sy);
        x = nx;
        y = ny;
        if (x < 0)
            sx *= -1, x = -x;
        if (y < 0)
            sy *= -1, y = -y;
    };
    while (ans--) {
        if (ans == 1) {
            bool sw = false;
            if (x > y)
                sw = true, swap(x, y);
            int cx = (x - y) / 2, cy = (x + y) / 2;
            x = cy - k;
            y = cy;
            if (sw)
                swap(x, y);
            add(x, y);
        } else {
            if (x > k)
                add(x - k, y);
            else
                add(0, y - (k - x));
        }
    }
    as.pop_back();
    reverse(rng(as));
    for (auto p : as)
        cout << p.fi << " " << p.se << endl;
    return 0;
}


Measured memory_bytes: 5184