#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;using ll = long long;using PLL = pair<ll,ll>;
const ll MAX = 1e18;const ll MIN = -1e18;const ll INF=0x3f3f3f3f;
const ll Q = 2e5+9;const ll MOD = 1e9 + 7;
ll a[105][105];ll n,x,y;ll cnt;
struct edge
{
	ll a,b,c,d;
};

vector<edge> ans;
void zs(){
	for (ll i = 1; i < x; i++)
	{
		for (ll j = 1; j < y; j++)
		{
			if(a[i][j]==0 and a[i+1][j]==0 and a[i][j+1]==0){
				for (ll k = i; k <= i+cnt; k++)
				{
					a[k][j]=1;
				}
				for (ll k = j; k <= j+cnt; k++)
				{
					a[i][k]=1;
				}
				ans.push_back({i,j,cnt,cnt});
				cnt--;
			}
		}
		
	}
	
}
void ys(){
	for (ll i = 1; i < x; i++)
	{
		for (ll j = n; j > y; j--)
		{
			if(a[i][j]==0 and a[i+1][j]==0 and a[i][j-1]==0){
				for (ll k = i-cnt; k <= i; k++)
				{
					a[k][j]=1;
				}
				for (ll k = j; k <= j+cnt; k++)
				{
					a[i][k]=1;
				}
				ans.push_back({i,j,cnt,-cnt});
				cnt--;
			}
		}
		
	}
	
}
void yx(){
	for (ll i = n; i > x; i--)
	{
		for (ll j = n; j > y; j--)
		{
			if(a[i][j]==0 and a[i-1][j]==0 and a[i][j-1]==0){
				for (ll k = i-cnt; k <= i; k++)
				{
					a[k][j]=1;
				}
				for (ll k = j-cnt; k <= j; k++)
				{
					a[i][k]=1;
				}
				ans.push_back({i,j,-cnt,-cnt});
				cnt--;
			}
		}
		
	}
	
}

void zx(){
	for (ll i = n; i > x; i--)
	{
		for (ll j = 1; j < y; j++)
		{
			if(a[i][j]==0 and a[i-1][j]==0 and a[i][j+1]==0){
				for (ll k = i-cnt; k <= i; k++)
				{
					a[k][j]=1;
				}
				for (ll k = j; k <= j+cnt; k++)
				{
					a[i][k]=1;
				}
				ans.push_back({i,j,-cnt,cnt});
				cnt--;
			}
		}
		
	}
	
}
void solve(){
   cin>>n>>x>>y;cnt=n-1;
   cout<<"Yes\n";
   zs();ys();yx();zx();
   cout<<ans.size()<<"\n";
   for(auto [a1,a2,a3,a4]:ans){
		cout<<a1<<" "<<a2<<" "<<a3<<" "<<a4<<"\n";
   }
}
int main(){
	ios;ll _=1;//cin>>_;
	while (_--)solve();
	return 0;
}