#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

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

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll K, X, Y;
  cin >> K >> X >> Y;
  bool rev_x = (X < 0), rev_y = (Y < 0);
  X = abs(X);
  Y = abs(Y);
  bool swapped = (X < Y);
  if (swapped) {
    swap(X, Y);
  }
  vector<pll> ans;
  ll x = 0, y = 0;

  if ((X + Y) % 2 == 1 && K % 2 == 0) {
    cout << -1 << endl;
    return 0;
  }

  if (X + Y < K) {
    if ((X + Y) % 2 == 0) {
      // K%2==0
      ll a = (2 * K - (X + Y)) / 2;
      x += K - a;
      y -= a;
      ans.push_back(make_pair(x, y));
      ans.push_back(make_pair(X, Y));
    } else {
      // K%2==1
      y -= K - X;
      x += X;
      ans.push_back(make_pair(x, y));
      ll diff = (Y - y) / 2;
      x += K - diff;
      y += diff;
      ans.push_back(make_pair(x, y));

      x -= K - diff;
      y += diff;
      ans.push_back(make_pair(x, y));
    }
  } else if (X + Y == K) {
    ans.push_back(make_pair(X, Y));
  } else {
    ll n = (X + Y + K - 1) / K;
    if (K * n % 2 != (X + Y) % 2) {
      n++;
    }
    ll addy = (K * n - X - Y) / 2;
    x += K - addy;
    y -= addy;
    ans.push_back(make_pair(x, y));

    while (x + K < X) {
      x += K;
      ans.push_back(make_pair(x, y));
    }

    ll diff = X - x;
    x += diff;
    y += K - diff;
    ans.push_back(make_pair(x, y));

    while (y < Y) {
      y += K;
      ans.push_back(make_pair(x, y));
    }
  }
  cout << ans.size() << endl;
  AUTO(a, ans) {
    if (swapped)
      swap(a.first, a.second);
    if (rev_x)
      a.first *= -1;
    if (rev_y)
      a.second *= -1;
    cout << a.first << " " << a.second << endl;
  }

  return 0;
}


Measured memory_bytes: 5744