#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1009;
const int M = 5e5 + 1009;
struct node{
    int a, b, c, d;
};
vector<node> ans;
int n, a, b;
void work() {
    cin >> n >> a >> b;
    if(n == 1) {
        cout <<"No" << endl;
        return;
    }
    int d = min(a, b);
    for(int i = 1; i < d; i ++)
        ans.push_back({i, i, n - i, n - i});

    if(a > b) {
        for(int i = d; i < a; i ++) {
            ans.push_back({i, n - i + d, n - i, -(n - i)});
        }
    } else if(b > a) {
        for(int i = d; i < b; i ++) {
            ans.push_back({n - i + d, i, -(n - i), n - i});
        }
    }
    int w = n - ans.size() - 1;
    for(int i = 1; i <= w; i ++)
        ans.push_back({a + i, b + i, -i, i});
    cout <<"Yes" << endl;
    cout << ans.size() << endl;
    for(auto [a, b, c, d] : ans)
        cout << a << " "<< b << " " << c << " " <<d << endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int Case = 1;
    while(Case --) work();
    return 0;
}