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

struct NODE
{
    int r, c, h, w;
};

vector<NODE> ans;

void solve()
{
    int n, x, y;
    cin >> n >> x >> y;
    ans.clear();
    int len = 0;
    int MAX = min(x, y), MIN = min(x, y);
    for (int i = 1; x + i <= n && y + i <= n; i++)
    {
        int r = x + i, c = y + i;
        len++;
        // cout << r << " " << c << " " << -len << " " << -len << endl;
        ans.push_back({r, c, -len, -len});
        if (x + i == n || y + i == n)
        {
            if (x + i == n && y + i != n)
            {
                MAX = y + i;
            }
            else if (x + i != n && y + i == n)
            {
                MAX = x + i;
            }
            else
            {
                MAX = -1;
            }
        }
    }

    for (int j = 1; x - j >= 1 && y - j >= 1; j++)
    {
        int r = x - j, c = y - j;
        len++;
        // cout << r << " " << c << " " << len << " " << len << endl;
        ans.push_back({r, c, len, len});
        if (x - j == 1 || y - j == 1)
        {
            if (x - j == 1 && y - j != 1)
            {
                MIN = y - j;
            }
            else if (x - j != 1 && y - j == 1)
            {
                MIN = x - j;
            }
            else
            {
                MIN = -1;
            }
        }
    }

    if (MAX > 0 && MIN > 0)
    {
        for (int i = 1; MAX + i <= n && MIN - i >= 1; i++)
        {
            int r = MAX + i, c = MIN - i;
            len++;
            // cout << r << " " << c << " ";
            if (r > x && c > y)
            {
                // cout << -len << " " << -len << endl;
                ans.push_back({r, c, -len, -len});
            }
            else if (r > x && c < y)
            {
                // cout << -len << " " << len << endl;
                ans.push_back({r, c, -len, len});
            }
            else if (r < x && c > y)
            {
                // cout << len << " " << -len << endl;
                ans.push_back({r, c, len, -len});
            }
            else
            {
                //cout << len << " " << len << endl;
                ans.push_back({r, c, len, len});
            }
        }
    }

    cout << "Yes" << endl;
    cout << ans.size() << endl;
    for (int i = 0; i < ans.size(); i++)
    {
        cout << ans[i].r << " " << ans[i].c << " " << ans[i].h << " " << ans[i].w << endl;
    }
}

int main()
{
    solve();
    return 0;
}