#include <bits/stdc++.h>
using namespace std;
#define int long long
struct node{
    int a,b,c,d;
};
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,x,y;
    cin >> n >> x >> y;
    int sx = x;
    int sy = y;
    vector<node>ans;
    int cur = 1;
    while(x > 1 && y < n){
        x--; y++;
        ans.push_back({x,y,cur,-cur});
        cur++;
    }
    if(x == 1){
        while(y < n){
            y++;
            sx++;
            ans.push_back({sx,y,-cur,-cur});
            cur++;
        }
    }
    else{
        while(x > 1){
            x--; sy--;
            ans.push_back({x,sy,cur,cur});
            cur++;
        }
    }
    while(cur < n){
        ans.push_back({cur+1,n-cur,-cur,cur});
        cur++;
    }
    cout << "Yes\n";
    cout << ans.size() << '\n';
    for(auto nxt: ans){
        cout << nxt.a << ' ' << nxt.b << ' ' << nxt.c << ' ' << nxt.d << '\n';
    }
    return 0;
}