#define _CRT_SECURE_NO_WARNINGS
//#include<bits/stdc++.h>
//using namespace std;
//typedef long long ll;
//typedef long double ld;
//#define endl '\n'
//const ll maxn = 1e5 + 5;
//ll n;
//ll a[maxn];
//int main()
//{
//	ios::sync_with_stdio(0);
//	cin.tie(0);
//	cout.tie(0);
//	ll T;
//	cin >> T;
//	while (T--) {
//		cin >> n;
//		ll ans = 0;
//		map<ll, vector<ll>>is;
//		for (ll i = 1; i <= n; i++) {
//			cin >> a[i];
//			is[a[i] - i].push_back(a[i]);
//		}
//		for (auto& it : is) {
//			auto& v = it.second;
//			sort(v.begin(), v.end());
//			for (ll i = v.size() - 1; i - 1 >= 0; i-=2) {
//				ll t = v[i] + v[i - 1];
//				if(t > 0)ans += t;
//			}
//		}
//		cout << ans << endl;
//	}
//}
//#include<bits/stdc++.h>
//using namespace std;
//typedef long long ll;
//typedef long double ld;
//#define endl '\n'
//const ll maxn = 1e5 + 5;
//ll n;
//ll v[maxn], w[maxn];
//bool check(ll x) {
//	vector<ll>l, r;
//	for (ll i = 1; i <= n; i++) {
//		if (v[i] < x) {
//			l.push_back(w[i]);
//		}
//		else {
//			r.push_back(v[i] + w[i]);
//		}
//	}
//	if (l.size() > r.size()) return false;
//	sort(l.begin(), l.end());
//	sort(r.begin(), r.end());
//	ll cur = r.size() - 1;
//	for (ll i = l.size() - 1; i >= 0; i--) {
//		ll t = l[i];
//		if (r[cur] - t < x) return false;
//		cur--;
//	}
//	return true;
//}
//int main()
//{
//	ios::sync_with_stdio(0);
//	cin.tie(0);
//	cout.tie(0);
//	ll T;
//	cin >> T;
//	while (T--) {
//		cin >> n;
//		for (ll i = 1; i <= n; i++) {
//			cin >> v[i] >> w[i];
//		}
//		ll l = 0, r = 1e9 + 5;
//		while (l < r - 1) {
//			ll mid = (l + r) >> 1;
//			if (check(mid))l = mid;
//			else r = mid;
//		}
//		cout << l << endl;
//	}
//}
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define endl '\n'
const ll maxn = 1e5 + 5;
ll n, xi, yi;
struct node {
	ll a, b, c, d;
};
vector<node>ans;
void put(ll tx, ll ty,ll px,ll py) {
	ans.push_back({ tx,ty, px - tx, py - ty });
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> xi >> yi;
	ll pi = xi + yi;
	if (pi > n + 1) {
		ll tx = xi - 1, ty = yi - 1;
		ll d = xi + yi - (n + 1);
		ll t = d;
		while (t--) {
			put(tx, ty, xi, yi);
			tx--; ty--;
		}
		ll rx = xi - d, ry = yi;
		ll lx = xi, ly = yi - d;
		tx = lx + 1, ty = ly - 1;
		while (ty > 0) {
			put(tx, ty, rx, ry);
			//cout << tx << " " << ty << " " << rx - tx << " " << ry - ty << endl;
			tx++; ty--;
		}
		tx = rx - 1, ty = ry + 1;
		while (tx > 0) {
			put(tx, ty, n, 1);
			//cout << tx << " " << ty << " " << n - tx << " " << 1 - ty << endl;
			tx--; ty++;
		}
	}
	else if (pi <= n + 1) {
		ll tx = xi + 1, ty = yi + 1;
		ll d = -(xi + yi) + (n + 1);
		ll t = d;
		while (t--) {
			put(tx, ty, xi, yi);
			//print(tx, ty);
			tx++; ty++;
		}
		ll rx = xi, ry = yi + d;
		ll lx = xi + d, ly = yi;
		tx = lx + 1, ty = ly - 1;
		while (ty > 0) {
			put(tx, ty, rx, ry);
			//cout << tx << " " << ty << " " << rx - tx << " " << ry - ty << endl;
			tx++; ty--;
		}
		tx = rx - 1, ty = ry + 1;
		while (tx > 0) {
			put(tx, ty, n, 1);
			//cout << tx << " " << ty << " " << n - tx << " " << 1 - ty << endl;
			tx--; ty++;
		}
	}
	cout << "Yes" << endl;
	cout << ans.size() << endl;
	for (auto it : ans) {
		cout << it.a << " " << it.b << " " << it.c << " " << it.d << endl;
	}
}