#define MOD_TYPE 1

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using multiInt = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9;
constexpr ll LINF = (ll)4e18;
constexpr ld PI = acos(-1.0);
constexpr ld EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

inline void init_main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);
}
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
#pragma endregion

int main()
{
  init_main();

  ll k, x, y;
  cin >> k >> x >> y;
  bool xr = false, yr = false, swp = false;
  if (x < 0)
  {
    xr = true;
    x *= -1;
  }
  if (y < 0)
  {
    yr = true;
    y *= -1;
  }
  if (x < y)
  {
    swp = true;
    swap(x, y);
  }
  ll d = x + y;
  if (d % 2 == 1 && k % 2 == 0)
  {
    cout << -1 << endl;
    return 0;
  }

  vector<pll> ans;
  auto push = [&](ll xi, ll yi) { ans.push_back(MP(xi, yi)); };

  ll a = 0, b = 0;
  if (d < k && d % 2 == 1)
  {
    assert(k % 2 == 1);
    ll A = k - x;
    assert((3 * k - d - 2 * A) % 2 == 0);
    ll B = (3 * k - d - 2 * A) / 2;
    a += x, b -= A;
    push(a, b);
    ll r = (x + B) - a;
    a += r;
    assert((A + y) % 2 == 0);
    b += (A + y) / 2;
    push(a, b);
    a -= r;
    b += (A + y) / 2;
    push(a, b);
    assert(a == x && b == y);
  }
  else if (d % k == 0)
  {
    while (d > 0)
    {
      if (a + k > x)
      {
        b += k - (x - a);
        a += x - a;
      }
      else
      {
        a += k;
      }
      d -= k;
      push(a, b);
    }
    assert(a == x && b == y);
  }
  else
  {
    ll n = CEIL(d, k);
    if (d < k && d % 2 == 0)
      n = 2;
    else if ((n * k - d) % 2 == 1)
      n++;
    assert((n * k - d) % 2 == 0);
    ll adj = (n * k - d) / 2;
    a = k - adj;
    b = -adj;
    d += adj - a;
    push(a, b);
    while (d > 0)
    {
      if (a + k > x)
      {
        b += k - (x - a);
        a += x - a;
      }
      else
      {
        a += k;
      }
      d -= k;
      push(a, b);
    }
    assert(a == x && b == y);
  }

  cout << ans.size() << "\n";
  for (auto p : ans)
  {
    ll xi, yi;
    tie(xi, yi) = p;
    if (swp)
      swap(xi, yi);
    cout << xi * (xr ? -1 : 1) << " " << yi * (yr ? -1 : 1) << "\n";
  }
  return 0;
}

Measured memory_bytes: 5484