#include <iostream>
#include <bits/stdc++.h>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <tuple>
#include <time.h>
#include <random>
#include <unistd.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 1e18;
double Pi = 3.1415926535897932384626;

vector<ll> G[500005];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define line cout << "----------" << endl;


ll mod = 1000000007;
ll rui(ll number1,ll number2){

    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){

    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){

    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){

    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

/*
ll fact[800005],rfact[800005];

void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=800000; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
	rfact[800000] = rui(fact[800000],mod - 2);
	for(ll i=800000; i>=1; i--){
	   rfact[i-1] = rfact[i] * i;
	   rfact[i-1] %= mod;
	}
	return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;}
*/

ll n,m,num,sum,ans,a,b,c,d,e,g,h,w,i,j,k,q;
ll x[300005],y[300005],z[100005];
ll gx,gy;
ll ans_num;
ll nowposx,nowposy;
ll yorimiti;
bool x_flag,y_flag;

void print_ans(){
    p(ans_num);
    for(ll i=0;i<ans_num;i++){
        if(x_flag){
            pe(x[i] * -1);
        }else{
            pe(x[i]);
        }
        if(y_flag){
            p(y[i] * -1);
        }else{
            p(y[i]);
        }
    }
    return;
}
void push_now(){
    x[ans_num] = nowposx;
    y[ans_num] = nowposy;
    ans_num ++;
    return;
}
void go(ll n,ll yorimiti){
    ll dis_x = abs(gx - nowposx);
    ll dis_y = abs(gy - nowposy);
    ll zissai = n - yorimiti;
   // pe("yorimiti = ");p(yorimiti);
   // pe("zissai = ");p(zissai);
    if(zissai <= dis_x){
        if(gx > nowposx){
            nowposx += zissai;
        }else{
            nowposx -= zissai;
        }
        if(gy > nowposy){
            nowposy -= yorimiti;
        }else{
            nowposy += yorimiti;
        }
    }else{
        if(nowposx < gx){
            nowposx = gx + yorimiti;
        }else{
            nowposx = gx - yorimiti;
        }
        zissai -= dis_x;
        if(zissai < dis_y){
            if(gy > nowposy){
                nowposy += zissai;
            }else{
                nowposy -= zissai;
            }
        }else{
            if(gy > nowposy){
                nowposy += zissai;
            }else{
                nowposy -= zissai;
            }
        }
    }
    push_now();
    return;
}



int main(){
	cin >> n;
    cin >> gx >> gy;
    if(gx < 0){
        x_flag = true;
        gx *= -1;
    }
    if(gy < 0){
        y_flag = true;
        gy *= -1;
    }
    if(n % 2 == 0 && ((gx + gy) % 2 == 1)){
        p(-1);
    }else{
        ll distance = gx + gy;
        if(distance % n == 0){
            for(ll i=0;i<distance / n;i++){
                go(n,0);
            }
        }else{
            if(n > distance){
                if(distance % 2 == 0){
                    //2回でいける
                    yorimiti = (2 * n - distance) / 2;
                    go(n,yorimiti);
                    go(n,0);
                }else{
                    //3回でいける
                    go(n,0);
                    distance = abs(gx - nowposx) + abs(gy - nowposy);
                    yorimiti = (2 * n - distance) / 2;
                    go(n,yorimiti);
                    go(n,0);
                }
            }else{
                if(distance % 2 == 0){
                    //2回でいける
                    if((n - (distance % n)) % 2 == 0){
                        yorimiti = (n - (distance % n)) / 2;
                    }else{
                        yorimiti = (2 * n - (distance % n)) / 2;
                    }
                    go(n,yorimiti);
                    go(n,0);
                }else{
                    //3回でいける
                    go(n,0);
                    distance = abs(gx - nowposx) + abs(gy - nowposy);
                    if((n - (distance % n)) % 2 == 0){
                        yorimiti = (n - (distance % n)) / 2;
                    }else{
                        yorimiti = (2 * n - (distance % n)) / 2;
                    }
                    go(n,yorimiti);
                    go(n,0);
                }
                while(1){
                    distance = abs(gx - nowposx) + abs(gy - nowposy);
                    if(distance < n)break;
                    go(n,0);
                    distance = abs(gx - nowposx) + abs(gy - nowposy);
                }
                
            }
        }
        print_ans();
    }
	return 0;
}



Measured memory_bytes: 18688