#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fup(a, b, c, d) for(int a = (b); a <= (c); a += (d))
#define fdo(a, b, c, d) for(int a = (b); a >= (c); a -= (d))
typedef long long ll;
typedef pair<int , int> PII;
typedef map<int , int> MII;
const int inf = 0x3f3f3f3f, N = 1e3 + 10, M = 4e5 + 10, mod = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f3f;

int n, x, y;





void solve()
{
    cin >> n >> x >> y;

    cout << "Yes\n";
    cout << n - 1 << '\n';

    int r = x, l = y, nu = 1;
    if(x < y) {
        
        fup(i, 1, r - 1, 1) {
            cout << r - i << ' ' << l - i << ' ' << nu << ' ' << nu << '\n';
            nu ++;
        }

        fup(i, 1, l - r, 1) {
            cout << r + i - (l - 1) << ' ' << l - i << ' ' << -nu << ' ' << nu << '\n';
            nu ++;
        }

        fup(j, 1, n - l, 1) {
            cout << l + j << ' ' << l + j << ' ' << -nu << ' ' << -nu << '\n';
            nu ++;
        }
    }
    else if(x == y) {
        fup(i, 1, r - 1, 1) {
            cout << r - i << ' ' << l - i << ' ' << nu << ' ' << nu << '\n';
            nu ++;
        }

        fup(j, 1, n - r, 1) {
            cout << r + j << ' ' << l + j << ' ' << -nu << ' ' << -nu << '\n';
            nu ++;
        }
    }
    else {
        fup(i, 1, l - 1, 1) {
            cout << r - i << ' ' << l - i << ' ' << nu << ' ' << nu << '\n';
            nu ++;
        }

        fup(i, 1, r - l, 1) {
            cout << r - i << ' ' << l + i - (l - 1) << ' ' << nu << ' ' << -nu << '\n';
            nu ++;
        }

        fup(j, 1, n - r, 1) {
            cout << r + j << ' ' << r + j << ' ' << -nu << ' ' << -nu << '\n';
            nu ++;
        }
    }


    



}

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

    int _ = 1;
    // cin >> _;
    while(_ --)
    {
        solve();
    }
}