#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define rep(i, l, r) for (int i = l; i < r; ++i)
#define per(i, r, l) for (int i = r-1; i >= l; --i)
typedef long long ll;
typedef pair<int, int> PI;
template<typename T> bool setmax(T &a, T b) { return (a < b ? a = b, 1 : 0); }
template<typename T> bool setmin(T &a, T b) { return (a > b ? a = b, 1 : 0); }

int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int n, x, y; cin >> n >> x >> y;
    vector<array<int, 4>> ans;

    vector<int> gone(n + 1);
    gone[y] = 1;
    int d = 1;
    // you shang
    while (x - d > 0 && y + d <= n) {
        gone[y + d] = 1;
        ans.push_back({x - d, y + d, d, -d});
        ++d;
    }
    int dd = 1;
    while (x + dd <= n && y - dd > 0) {
        gone[y - dd] = 1;
        ans.push_back({x + dd, y - dd, -d, d});
        ++dd;
        ++d;
    }

    int cury = 0;
    for (int i = n; i >= 1; i--) if (!gone[i]) {
        cury = i;
        break;
    }
    // cout << cury << ' ' << d << ' ' << n << '\n';
    if (cury + d > n) {
        while (cury != 0 && cury <= n) {
            ans.push_back({cury, cury, -d, -d});
            ++d;
            ++cury;
        }
    } else {
        while (cury > 0 && n != 1) {
            ans.push_back({cury, cury, d, d});
            ++d;
            --cury;
        }
    }

    cout << "Yes\n";
    cout << sz(ans) << '\n';
    for (auto [r, c, h, w] : ans) cout << r << ' ' << c << ' ' << h << ' ' << w << '\n';

    return 0;
}