#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;

int main(){
	ll k,x,y; cin >> k >> x >> y;
	ll ab = abs(x) + abs(y);
	if(k & 1 ^ 1){
		if(ab & 1){
			cout << -1 << endl;
			return 0;
		}
	}
	ll r = ab % k;
	int f = (x < 0) ? 1 : -1;
	int g = (y < 0) ? 1 : -1;
	vpl ans;
	ll nx = 0, ny = 0;
	if(k & 1){
		if(r != 0){
			if((k-r) & 1){
				ll rest = (k + k - r) / 2;
				if(k-rest <= abs(x)){
					nx = (-f) * (k - rest);
					ny = g * rest;
				}else{
					nx = x + (-f) * rest;
					ny = (-g) * (k - abs(x) - rest);
				}
			}else{
				if(abs(x) + abs(y) < k){
					ans.emplace_back(f*k,0);
					ll rest = k - abs(x) - abs(y);
					nx = f * rest / 2;
					ny = g * rest / 2;
				}else{
					ll rest = (k - r) / 2;
					if(k-rest <= abs(x)){
						nx = (-f) * (k - rest);
						ny = g * rest;
					}else{
						nx = (-f) * (x + rest);
						ny = (-g) * (k - abs(x) - rest);
					}
				}
			}
			ans.emplace_back(nx,ny);
		}
	}else{
		if(r != 0){
			r = k - r;
			r /= 2;
			if(abs(k-r) <= abs(x)){
				nx = -f*(k-r); ny = g*r;
			}else{
				if(abs(y) + abs(x) < k){
					if(abs(y) <= abs(x)){
						nx = (abs(y) + abs(x)) / 2 * (-f);
						ny = g * (k - abs(nx));
					}else{
						ny = (-g) * (abs(y) - abs(x)) / 2;
						nx = (-f) * (k - abs(ny));
					}
					ans.emplace_back(nx,ny);
					nx = x; ny = y;
				}else{
					nx = x + (-f)*r; ny = g * (abs(nx) - k);
				}
			}
			ans.emplace_back(nx,ny);
		}
	}
	while(nx != x || ny != y){
		if(nx < x){
			if(nx + k < x) ans.emplace_back(nx+k,ny), nx += k;
			else{
				ll rest = k - (x - nx);
				ny += (-g) * rest;
				nx = x;
				ans.emplace_back(nx,ny);
			}
		}else{
			if(nx - k > x) ans.emplace_back(nx-k,ny), nx -= k;
			else{
				ll rest = k - (nx - x);
				ny += (-g) * rest;
				nx = x;
				ans.emplace_back(nx,ny);
			}
		}
	}
	cout << ans.size() << "\n";
	for(auto i : ans) print2(i.first,i.second);
}


Measured memory_bytes: 7404