#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

// x >= 0, y >= 0
// xy.size() <= 3
vvll calc(ll k, ll x, ll y) {
  vvll xy;
  if ((x + y) == k) {
    xy.assign(1, vll(2));
    xy[0][0] = x;
    xy[0][1] = y;
    return xy;
  }
  if ((x + y) % 2 == 0 && (x + y) <= k * 2) {
    xy.assign(2, vll(2));
    ll back = (k * 2 - (x + y)) / 2;
    int index_back = 0;
    if (x > y) {
      index_back = 1;
    }
    xy[0][index_back] = -back;
    xy[0][1 - index_back] = k - back;
    xy[1][1 - index_back] = max(x, y) - (k - back);
    xy[1][index_back] = min(x, y) + back;
    return xy;
  }
  if ((x + y) % 2 == 0) {
    ll bx, by, dx, dy;
    bx = max(0LL, x - k);
    dx = x - bx;
    dy = k - dx;
    by = y - dy;
    xy = calc(k, bx, by);
    xy.push_back({dx, dy});
    return xy;
  }
  if ((x + y) % 2 == 1 && (x + y) <= k * 3) {
    ll bx, by, dx, dy;
    if ((x + y) >= k) {
      bx = max(0LL, x - k);
      dx = x - bx;
      dy = k - dx;
      by = y - dy;
    } else {
      bx = x + k;
      dx = x - bx;
      by = y;
      dy = y - by;
    }
    xy = calc(k, bx, by);
    xy.push_back({dx, dy});
    return xy;
  }
  assert (false);
}

bool xr, yr;
vvll xy;
void print_ans() {
  int s = xy.size();
  if (xr) {
    rep (i, s) {
      xy[i][0] *= (-1);
    }
  }
  if (yr) {
    rep (i, s) {
      xy[i][1] *= (-1);
    }
  }
  print(s);
  ll x = 0;
  ll y = 0;
  rep (i, s) {
    x += xy[i][0];
    y += xy[i][1];
    printf("%lld %lld\n", x, y);
  }
  exit(0);
}

int main() {
  ll k, x, y;
  scan(k, x, y);
  xr = (x < 0);
  yr = (y < 0);
  x = max(x, -x);
  y = max(y, -y);

  if (k % 2 == 0 && (x + y) % 2 == 1) {
    printf("-1\n");
    return 0;
  }
  if ((x + y) == k) {
    xy = calc(k, x, y);
    print_ans();
  }
  if (k % 2 == 1 && (x + y) % 2 == 1 && (x + y) <= k * 3) {
    xy = calc(k, x, y);
    print_ans();
  }

  ll fx = x % k;
  ll fy = y % k;
  if (fx == x && fy == y) {
    xy = calc(k, x, y);
    print_ans();
  }
  int cntx = (x - fx) / k;
  int cnty = (y - fy) / k;
  if (cntx > 0) {
    xy = calc(k, fx + k, fy);
    rep (i, cntx-1) {
      xy.push_back({k, 0});
    }
    rep (i, cnty) {
      xy.push_back({0, k});
    }
  } else {
    xy = calc(k, fx, fy + k);
    rep (i, cntx) {
      xy.push_back({k, 0});
    }
    rep (i, cnty-1) {
      xy.push_back({0, k});
    }
  }
  print_ans();

  return 0;
}


Measured memory_bytes: 13612