#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<ll> vec;
typedef vector<string> svec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;

void solve() {
	ll k, x, y; cin >> k >> x >> y;
	bool bx = false, by = false;
	if (x < 0) {
		bx = true; x = abs(x);
	}
	if (y < 0) {
		by = true; y = abs(y);
	}
	ll cx = 0, cy = 0;
	if (k % 2 == 0 && (abs(x) + abs(y)) % 2) {
		cout << -1 << endl; return;
	}
	vector<LP> ans;

	while (abs(x-cx)+abs(y-cy)>=2*k) {
		ll xdif = x - cx;
		if (xdif > k)xdif = k;
		ll ydif = 0;
		if (abs(xdif) < k) {
			int id = 1;
			if (cy > y)id = -1;
			ydif = id * (k - abs(xdif));
		}
		cx += xdif; cy += ydif;
		//cout << xdif << " " << ydif << endl;
		//cout << cx << " " << cy << endl;
		ans.push_back({ cx,cy });
	}
	ll dist = x - cx + y - cy;
	//cout << "?? " << cx << " " << cy << endl;
	//cout << dist << endl;
	if (dist == k) {
		ans.push_back({ x,y });
	}
	else if (dist < k) {
		if (k % 2) {
			if (dist % 2) {
				//cout << "Hello" << endl;
				ans.push_back({ cx - k,cy });
				cx -= k;
				ll dx = x - cx, dy = y - cy;
				if (dx >= k) {
					ll a = (dx + dy) / 2;
					ll b = k - a;
					ll c = dx - a;
					ll d = k - c;
					ans.push_back({ cx + a,cy - b });
					ans.push_back({ x,y });
				}
				else if (dy >= k) {
					ll a = (dx + dy) / 2;
					ll b = k - a;
					ll c = dy - a;
					ll d = k - c;
					ans.push_back({ cx - b,cy + a });
					ans.push_back({ x,y });
				}
				else if(dx<dy){
					ll a = k - (dx + dy) / 2;
					ll b = k - a;
					ll c = a + dx;
					ll d = k - c;
					ans.push_back({ cx - a,cy + b });
					ans.push_back({ x,y });
				}
				else {
					ll a = (k - (dx + dy) / 2);
					ll b = k - a;
					ll c = a + dy;
					ll d = k - c;
					ans.push_back({ cx + b,cy - a });
					ans.push_back({ x,y });
				}
			}
			else {
				ll dx = x - cx, dy = y - cy;
				if (dx >= k) {
					ll a = (dx + dy) / 2;
					ll b = k - a;
					ll c = dx - a;
					ll d = k - c;
					ans.push_back({ cx + a,cy - b });
					ans.push_back({ x,y });
				}
				else if (dy >= k) {
					ll a = (dx + dy) / 2;
					ll b = k - a;
					ll c = dy - a;
					ll d = k - c;
					ans.push_back({ cx - b,cy + a });
					ans.push_back({ x,y });
				}
				else if (dx<dy) {
					ll a = k - (dx + dy) / 2;
					ll b = k - a;
					ll c = a + dx;
					ll d = k - c;
					ans.push_back({ cx - a,cy + b });
					ans.push_back({ x,y });
				}
				else {
					ll a = (k - (dx + dy) / 2);
					ll b = k - a;
					ll c = a + dy;
					ll d = k - c;
					ans.push_back({ cx + b,cy - a });
					ans.push_back({ x,y });
				}
			}
		}
		else {
			ll dx = x - cx, dy = y - cy;
			if (dx >= k) {
				ll a = (dx + dy) / 2;
				ll b = k - a;
				ll c = dx - a;
				ll d = k - c;
				ans.push_back({ cx + a,cy - b });
				ans.push_back({ x,y });
			}
			else if (dy >= k) {
				ll a = (dx + dy) / 2;
				ll b = k - a;
				ll c = dy - a;
				ll d = k - c;
				ans.push_back({ cx - b,cy + a });
				ans.push_back({ x,y });
			}
			else if (dx<dy) {
				ll a = k - (dx + dy) / 2;
				ll b = k - a;
				ll c = a + dx;
				ll d = k - c;
				ans.push_back({ cx - a,cy + b });
				ans.push_back({ x,y });
			}
			else {
				ll a = (k - (dx + dy) / 2);
				ll b = k - a;
				ll c = a + dy;
				ll d = k - c;
				ans.push_back({ cx + b,cy - a });
				ans.push_back({ x,y });
			}
		}
	}
	else {
		if (k % 2) {
			if (dist % 2) {
				ll difx = x - cx;
				if (difx > k)difx = k;
				ll dify = k-difx;
				ans.push_back({ cx + difx,cy + dify });
				cx += difx; cy += dify;
				ll dx = x - cx, dy = y - cy;
				if (dx >= k) {
					ll a = (dx + dy) / 2;
					ll b = k - a;
					ll c = dx - a;
					ll d = k - c;
					ans.push_back({ cx + a,cy - b });
					ans.push_back({ x,y });
				}
				else if (dy >= k) {
					ll a = (dx + dy) / 2;
					ll b = k - a;
					ll c = dy - a;
					ll d = k - c;
					ans.push_back({ cx - b,cy + a });
					ans.push_back({ x,y });
				}
				else if (dx<dy) {
					ll a = k - (dx + dy) / 2;
					ll b = k - a;
					ll c = a + dx;
					ll d = k - c;
					ans.push_back({ cx - a,cy + b });
					ans.push_back({ x,y });
				}
				else {
					ll a = (k - (dx + dy) / 2);
					ll b = k - a;
					ll c = a + dy;
					ll d = k - c;
					ans.push_back({ cx + b,cy - a });
					ans.push_back({ x,y });
				}
			}
			else {
				ll dx = x - cx, dy = y - cy;
				if (dx >= k) {
					ll a = (dx + dy) / 2;
					ll b = k - a;
					ll c = dx - a;
					ll d = k - c;
					ans.push_back({ cx + a,cy - b });
					ans.push_back({ x,y });
				}
				else if (dy >= k) {
					ll a = (dx + dy) / 2;
					ll b = k - a;
					ll c = dy - a;
					ll d = k - c;
					ans.push_back({ cx - b,cy + a });
					ans.push_back({ x,y });
				}
				else if (dx<dy) {
					ll a = k - (dx + dy) / 2;
					ll b = k - a;
					ll c = a + dx;
					ll d = k - c;
					ans.push_back({ cx - a,cy + b });
					ans.push_back({ x,y });
				}
				else {
					ll a = (k - (dx + dy) / 2);
					ll b = k - a;
					ll c = a + dy;
					ll d = k - c;
					ans.push_back({ cx + b,cy - a });
					ans.push_back({ x,y });
				}
			}
		}
		else {
			ll dx = x - cx, dy = y - cy;
			if (dx >= k) {
				ll a = (dx + dy) / 2;
				ll b = k - a;
				ll c = dx - a;
				ll d = k - c;
				ans.push_back({ cx + a,cy - b });
				ans.push_back({ x,y });
			}
			else if (dy >= k) {
				ll a = (dx + dy) / 2;
				ll b = k - a;
				ll c = dy - a;
				ll d = k - c;
				ans.push_back({ cx - b,cy + a });
				ans.push_back({ x,y });
			}
			else if (dx<dy) {
				ll a = k - (dx + dy) / 2;
				ll b = k - a;
				ll c = a + dx;
				ll d = k - c;
				ans.push_back({ cx - a,cy + b });
				ans.push_back({ x,y });
			}
			else {
				ll a = (k - (dx + dy) / 2);
				ll b = k - a;
				ll c = a + dy;
				ll d = k - c;
				ans.push_back({ cx + b,cy - a });
				ans.push_back({ x,y });
			}
		}
	}
	cout << ans.size() << endl;
	rep(i, ans.size()) {
		ll cx = ans[i].first;
		ll cy = ans[i].second;
		if (bx)cx = -cx;
		if (by)cy = -cy;
		cout << cx << " " << cy << endl;
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//cout << pow(1/6000.0, 1.0 / 25) << endl;
	//init();
	solve();
	//cout << "finish" << endl;
	//stop
	return 0;
}

Measured memory_bytes: 5484