/*

This Submission is to determine how many 120/240 min const. delivery point there are.

//info
120 req. steps <= 5

test_case 1,6 == 50 delivery point
		 2,3,4,5,7 == 80 delivery point
				8,9 == 90 delivery point
				10 > 100 delivery point
*/
#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 1000000007
#define seg_size 262144
#define REP(a,b) for(long long a = 0;a < b;++a)

unsigned long xor128() {
	static unsigned long x = time(NULL), y = 362436069, z = 521288629, w = 88675123;
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
int main() {
#define int long long
	long long k, x, y;
	cin >> k >> x >> y;
	int xe = 0, ye = 0;
	if (x < 0) {
		x = -x;
		xe = 1;
	}
	if (y < 0) {
		y = -y;
		ye = 1;
	}
	int hoget = 0;
	if (x < y) {
		swap(x, y);
		hoget = 1;
	}
	if (k % 2 == 0 && (x + y) % 2 == 1) {
		cout << "-1" << endl;
		return 0;
	}
	vector<pair<int, int>> next;
	if (x + y < k && (x + y) % 2 == 1) {
		next.push_back(make_pair(x - k, x));
		next.push_back(make_pair(x - (k + x - y) / 2, y - (k - llabs(x - (x - (k + x - y) / 2)))));
		next.push_back(make_pair(x, y));
	}
	else {
		int n;
		int c = (k - (x + y) % k) % k;
		if (x + y < k) {
			n = 2;
		}
		else {
			if (c % 2 == 0) {
				n = (x + y + k - 1) / k;
			}
			else {
				n = (x + y + k - 1) / k + 1;
			}
		}
		int now_x = 0;
		int now_y = 0;
		while (now_y - k > -(k * n - x - y) / 2) {
			now_y -= k;
			next.push_back(make_pair(now_x, now_y));
		}
		int next_x_move = (k * n - x - y) / 2 + now_x;
		if (k - next_x_move >= x) {
			next.push_back(make_pair(x, (k - next_x_move - x) - (k * n - x - y) / 2LL));
			now_x = next[next.size() - 1].first;
			now_y = next[next.size() - 1].second;
		}
		else {
			next.push_back(make_pair(k - next_x_move, -(k * n - x - y) / 2));
			now_x = next[next.size() - 1].first;
			now_y = next[next.size() - 1].second;
			while (now_x + k < x) {
				now_x += k;
				next.push_back(make_pair(now_x, now_y));
			}
			int now_cost = k - (x - now_x);
			next.push_back(make_pair(x, now_y + now_cost));
			now_x = next[next.size() - 1].first;
			now_y = next[next.size() - 1].second;
		}
		while (now_y != y) {
			now_y += k;
			next.push_back(make_pair(now_x, now_y));
		}
	}
	cout << next.size() << endl;
	REP(q, next.size()) {
		if (hoget == 1) {
			swap(next[q].first, next[q].second);
		}
		if (xe == 1) {
			next[q].first *= -1LL;
		}
		if (ye == 1) {
			next[q].second *= -1LL;
		}
		cout << next[q].first << " " << next[q].second << endl;
	}
	return 0;
}


Measured memory_bytes: 5484