#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

vector<tuple<int, int, int, int>> ans;
int n, x, y;

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> x >> y;
  int xl = x, xr = x, yl = y, yr = y;
  while (xl > 1 || xr < n|| yl > 1 || yr < n) {
    // cerr << xl << " " << xr << " " << yl << " " << yr << endl;
    if (xl - 1 > n - xr && yl - 1 > n - yr) {
      ans.emplace_back(xl - 1, yl - 1, xr - xl + 1, yr - yl + 1);
      xl--, yl--;
    } else if (xl - 1 > n - xr && yl - 1 <= n - yr) {
      ans.emplace_back(xl - 1, yr + 1, xr - xl + 1, -(yr - yl + 1));
      xl--, yr++;
    } else if (xl - 1 <= n - xr && yl - 1 > n - yr) {
      ans.emplace_back(xr + 1, yl - 1, -(xr - xl + 1), yr - yl + 1);
      xr++, yl--;
    } else if (xl - 1 <= n - xr && yl - 1 <= n - yr) {
      ans.emplace_back(xr + 1, yl + 1, -(xr - xl + 1), -(yr - yl + 1));
      xr++, yr++;
    }
  }
  cout << "Yes\n";
  cout << SZ(ans) << '\n';
  for (auto [a, b, c, d] : ans) cout << a << " " << b << " " << c << " " << d << '\n';
}