#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>
 
using namespace std;
 
typedef long long ll;

int sign(int x) {
  if (x >= 0) return 1;
  else return -1;
}

pair <int, int> get(int cx, int cy, int x, int y, int a, int b) {
  int len = abs(x - cx) + abs(y - cy);
  int tx = cx, ty = cy;
  pair <int, int> go = {0, 0};
  {
    int nx = x - cx;
    int ny = y - cy;
    int gx = min(a, abs(nx));
    if (gx < abs(nx)) {
      go.second = sign(cy - y);
    } else {
      go.first = sign(x - cx);
    }
    tx += gx * sign(x - cx);
    int gy = min(a - gx, abs(ny));
    ty += gy * sign(y - cy);
  }
  tx += go.first * b;
  ty += go.second * b;
  return {tx, ty};
}

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  int k, x, y;
  cin >> k >> x >> y;
  if (k % 2 == 0) {
    if ((abs(x) + abs(y)) % 2 == 1) {
      cout << "-1\n";
      return 0;
    }
    int ans = (abs(x) + abs(y) + k - 1) / k;
    vector <pair <int, int>> go;
    if (ans == 1) {
      if (abs(x) + abs(y) == k) {
        cout << "1\n";
        cout << x << ' ' << y << '\n';
        return 0;
      } else {
        ++ans;
      }
    }
    int cx = 0, cy = 0;
    while (ans > 2) {
      int nx = x - cx;
      int ny = y - cy;
      int gx = min(k, abs(nx));
      cx += gx * sign(x - cx);
      int gy = min(k - gx, abs(ny));
      cy += gy * sign(y - cy);
      go.push_back({cx, cy});
      --ans;
    } 
    assert(ans == 2);
    int len = abs(x - cx) + abs(y - cy);
    int b = (2 * k - len) / 2;
    int a = k - b;
    go.push_back(get(cx, cy, x, y, a, b));
    go.push_back({x, y});
    for (int i = 0; i < (int)go.size(); ++i) {
      int px = (i == 0 ? 0 : go[i - 1].first);
      int py = (i == 0 ? 0 : go[i - 1].second);
      int tx = go[i].first;
      int ty = go[i].second;
      assert(abs(tx - px) + abs(ty - py) == k);
    }
    cout << (int)go.size() << '\n';
    for (auto p : go) {
      cout << p.first << ' ' << p.second << '\n';
    }
  } else {
    int ans = (abs(x) + abs(y) + k - 1) / k;
    vector <pair <int, int>> go;
    if (ans == 1) {
      if (abs(x) + abs(y) == k) {
        cout << "1\n";
        cout << x << ' ' << y << '\n';
        return 0;
      } else {
        ++ans;
      }
    }
    if ((abs(x) + abs(y)) % 2 != ans % 2) {
      ++ans;
    }
    int cx = 0, cy = 0;
    while (ans > 2) {
      int nx = x - cx;
      int ny = y - cy;
      int gx = min(k, abs(nx));
      cx += gx * sign(x - cx);
      int gy = k - gx;
      cy += gy * sign(y - cy);
      go.push_back({cx, cy});
      --ans;
    } 
    assert(ans == 2);
    int len = abs(x - cx) + abs(y - cy);
    int b = (2 * k - len) / 2;
    int a = k - b;
    go.push_back(get(cx, cy, x, y, a, b));
    go.push_back({x, y});
    for (int i = 0; i < (int)go.size(); ++i) {
      int px = (i == 0 ? 0 : go[i - 1].first);
      int py = (i == 0 ? 0 : go[i - 1].second);
      int tx = go[i].first;
      int ty = go[i].second;
      assert(abs(tx - px) + abs(ty - py) == k);
    }
    cout << (int)go.size() << '\n';
    for (auto p : go) {
      cout << p.first << ' ' << p.second << '\n';
    }
  }
}



Measured memory_bytes: 3952