#include<bits/stdc++.h>

using namespace std;

typedef pair <int, int> pi;

int n, cx, cy;
vector <pair <pi, pi> > sol;

int main () {
    cin >> n >> cx >> cy;
    int len = 1;
    while (cx < n && cy > 1) {
        cx++; cy--; len++;
        sol.push_back({{cx, cy}, {-(len - 1), len - 1}});
    }
    if (cx == n) {
        while (cy > 1) {
            cy--; len++;
            sol.push_back({{n + 1 - len, cy}, {len - 1, len - 1}});
        }
    } else if (cy == 1) {
        while (cx < n) {
            cx++; len++;
            sol.push_back({{cx, len}, {-(len - 1), -(len - 1)}});
        }
    }
    while (len < n) {
        len++;
        sol.push_back({{n + 1 - len, len}, {len - 1, -(len - 1)}});
    }
    cout << "Yes\n";
    cout << sol.size() << '\n';
    for (int i = 0; i < sol.size(); i++) {
        int x = sol[i].first.first;
        int y = sol[i].first.second;
        int h = sol[i].second.first;
        int w = sol[i].second.second;
        cout << x << " " << y << " " << h << " " << w << '\n';
    }
    return 0;
}