#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    ll K,X,Y,S,T,n; cin >> K >> X >> Y;
    S = abs(X), T = abs(Y);
    int flg = 0;
    if(S<T) {
        swap(S,T);
        flg = 1;
    }
    corner(!(K%2)&&((S+T)%2),-1);
    vector<pair<ll,ll>> v;
    if(S+T<K) {
        if((S+T)%2) {
            n = 3;
            v.push_back({0,(-K+S)});
            v.push_back({(S+(K+S-T)/2),0});
            v.push_back({0,(K-S+T)});
            v.push_back({-(K+S-T)/2,0});
        }
        else {
            n = 2;
            v.push_back({0,-(K*n-S-T)/2});
            v.push_back({S,0});
            v.push_back({0,(K*n-S+T)/2});
        }
    }
    else{
        ll c = (K - ((S+T) % K)) % K;
        n = (S+T)/K + ((S+T)%K!=0) + (c%2);
        v.push_back({0,-(K*n-S-T)/2});
        v.push_back({S,0});
        v.push_back({0,(K*n-S+T)/2});
    }
    
    ll x = 0,y = 0,k = K;
    int idx = 0;
    vector<ll> ax,ay;
    while(x != S || y != T) {

        ll d;
        d = min(abs(v[idx].first),k);
        x += (v[idx].first<0?-1:1)*d;
        k -= d;
        v[idx].first += (v[idx].first<0?1:-1)*d;

        d = min(abs(v[idx].second),k);
        y += (v[idx].second<0?-1:1)*d;
        k -= d;
        v[idx].second += (v[idx].second<0?1:-1)*d;

        if(k==0) {
            k = K;
            ax.push_back(x);
            ay.push_back(y);
        }
        if(v[idx].first==0&&v[idx].second==0) {
            idx++;
        }
    }
    cout << n << endl;
    for(int i = 0; i < n; ++i) {
        if(flg) swap(ax[i],ay[i]);
        cout << (X>=0?1LL:-1LL)*ax[i] << " " << (Y>=0?1LL:-1LL)*ay[i] << endl;
    }
	return 0;
}


Measured memory_bytes: 5604