#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

ll K;
ll X, Y;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

void solve() {
	cin >> K;
	cin >> X >> Y;
	ll d = abs(X) + abs(Y);
	if(K % 2 == 0 && d % 2 == 1) {
		cout << -1 << "\n"; return;
	}

	vector<pl> vec;
	if(d < K) {
		if(d % 2 == 0) {
			vec.pb(pl(d / 2, K - d / 2));
			vec.pb(pl(d / 2, -(K - d / 2)));
		}
		else {
			vec.pb(pl((d + K) / 2, K - (d + K) / 2));
			vec.pb(pl((d + K) / 2, -(K - (d + K) / 2)));
			vec.pb(pl(-K, 0));
		}
	}
	else {
		if(d % K == 0) {
			rep(i, 0, d / K) vec.pb(pl(K, 0));
		}
		else {
			ll n = (d + K - 1) / K;
			if((n * K - d) % 2) n++;
			ll a = (n * K - d) / 2;
			vec.pb(pl(K - a, a));
			vec.pb(pl(K - a, -a));
			rep(i, 0, n - 2) {
				vec.pb(pl(K, 0));
			}
		}
	}
	int hd, vd, rhd, rvd;
	if(X >= 0 && Y >= 0) {
		hd = 0; vd = 1; rhd = 3; rvd = 0;
	}
	else if(Y >= 0) {
		hd = 2; vd = 1; rhd = 3; rvd = 2;
	}
	else if(X <= 0) {
		hd = 2; vd = 3; rhd = 1; rvd = 2;
	}
	else {
		hd = 0; vd = 3; rhd = 1; rvd = 0;
	}
	X = abs(X);
	ll xi = 0, yi = 0;
	vector<pl> ans;
	rep(i, 0, sz(vec)) {
		xi += vec[i].fst;
		yi += vec[i].sec;
		// debug(vec[i], hd, vd, rhd, dy[rvd]);
		if(xi < X) {
			ans.pb(pl(xi * dx[hd], yi * dy[rhd]));
		}
		else {
			ll tx = xi - X;
			ans.pb(pl(X * dx[hd] + yi * dx[rvd], tx * dy[vd]));
		}
	}
	cout << sz(ans) << "\n";
	rep(i, 0, sz(ans)) {
		cout << ans[i].fst << " " << ans[i].sec << "\n";
	}
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



Measured memory_bytes: 10604