#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(),x.end()
#define int long long
#define pb push_back

void dbg_out() { cerr << endl; }
template<typename H, typename... T>
void dbg_out(H h, T... t){ cerr << ' '  << h; dbg_out(t...);}
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

void solve_grid (int x, int y, int n, int m, vector<array<int, 4>> &ans) {
    if (n == 2) {
        assert (m > 2);
        ans.pb ({x, y, 1, m - 2});
        ans.pb ({x + 1, y + m - 1, -1, - (m - 2)});
        return;
    }
    if (m == 2) {
        assert (n > 2);
        ans.pb ({x, y, n - 2, 1});
        ans.pb ({x + n - 1, y + 1, - (n - 2), -1});
        return;
    }
    
    ans.pb ({x, y, n - 1, m - 1});
    solve_grid (x + 1, y + 1, n - 1, m - 1, ans);
}

void solve(){
    int n, bi, bj;
    cin >> n >> bi >> bj;

    bool troca = false;
    if (bi > bj) {
        swap (bi, bj);
        troca = true;
    }

    vector<array<int, 4>> ans;
    while (n > max (bi, bj)) {
        ans.pb ({n, n, - (n - 1), - (n - 1)});
        n--;
    }
    assert (bj == n);

    if (n == 2) {
        if (bi == 2) ans.pb ({1, 1, 1, 1});
        else {
            assert (bi == 1);
            ans.pb ({2, 1, -1, 1});
        }
    }
    else if (n == 3) {
        if (bi == 3) {
            ans.pb ({1, 1, 2, 2});
            ans.pb ({2, 2, 1, 1});
        }
        else if (bi == 2) {
            ans.pb ({1, 1, 2, 2});
            ans.pb ({3, 2, -1, 1});
        }
        else {
            ans.pb ({2, 2, -1, 1});
            ans.pb ({3, 1, -2, 2});
        }
    }
    else if (n > 3) {
        if (bi == n) {
            ans.pb ({1, n, n - 2, - (n - 2)});
            ans.pb ({2, 1, -1, n - 2});
            solve_grid (3, 1, n - 2, n - 1, ans);
        }
        else if (bi == n - 1) {
            ans.pb ({1, n, n - 3, - (n - 1)});
            ans.pb ({n, n - 1, -(n - 2), 1});
            solve_grid (2, 1, n - 1, n - 2, ans);
        }
        else if (bi == 2) {
            ans.pb ({1, n - 1, n - 2, 1});
            ans.pb ({n, n, - (n - 3), - (n - 1)});
            solve_grid (1, 1, n - 1, n - 2, ans);
        }
        else if (bi == 1) {
            ans.pb({n, n, - (n - 2), - (n - 2)});
            ans.pb ({n - 1, 1, 1, n - 2});
            solve_grid (1, 1, n - 2, n - 1, ans);
        }
        else {
            ans.pb ({1, n, bi - 2, - (n - 1)});
            ans.pb ({n, n, - (n - bi - 1), - (n - 1)});
            solve_grid (2, 1, n - 2, n - 1, ans);
        }
    }
    cout << "Yes\n";
    cout << ans.size () << "\n";
    for (auto [x, y, xx, yy] : ans) {
        if (troca) swap (x, y), swap (xx, yy);
        cout << x << " " << y << " " << xx << " " << yy << "\n";
    }
}

signed main(){
	ios::sync_with_stdio(false); cin.tie(0);
	solve();
}