#include <bits/stdc++.h>
using namespace std;
using ll=long long;
void solve()
{
    int n,a,b;
    cin>>n>>a>>b;
    cout<<"Yes\n";
    vector<int> ans;
    int d=min(a-1,n-b);
    int r=a-d,w=b+d;
    int h=w-r;
    bool f=1;
    for(;r<=n&&w>=1;r++,w--)
    {
        if(a==r&&b==w)
        {
            f=1-f;
            h=1;
            continue;
        }
        if(f)
        {
            ans.push_back(r);
        ans.push_back(w);
        ans.push_back(h);
        ans.push_back(-h);
        h--;
        }else{
            
            ans.push_back(r);
        ans.push_back(w);
        ans.push_back(-h);
        ans.push_back(h);
        h++;
        }
    }
    if(!(r==n+1&&w==0))
    {
        if(r==n+1)
        {
            r=a-d-1;
            f=1;
        }
        if(w==0)
        {
            w=b+d+1;
            f=0;
        }
        h=abs(b-a)+1+2*d;
    }
    if(f)
    {
        for(;r>0&&w>0;r--,w--)
        {
            ans.push_back(r);
        ans.push_back(w);
        ans.push_back(h);
        ans.push_back(-h);
        h++;
        }
    }else{
        for(;r<=n&&w<=n;r++,w++)
        {
            ans.push_back(r);
        ans.push_back(w);
        ans.push_back(-h);
        ans.push_back(h);
        h++;
        }
    }
    cout<<ans.size()/4<<'\n';
    for(int i=0;i<ans.size();i+=4)
    {
        cout<<ans[i]<<' '<<ans[i+1]<<' '<<ans[i+2]<<' '<<ans[i+3]<<'\n';
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t=1;
    // cin>>t;
    while(t--)
    solve();
    return 0;
}