#define _CRT_SECURE_NO_WARNINGS
#define X first
#define Y second
#include <iostream>
#include <vector>
using namespace std;
using pii = pair<int, int>;
struct Angle {
	pii t, d;
};
void push_ans(pii u, pii l, const pii p, vector<Angle>& ans) {
	while (p.X != u.X && p.Y != u.Y) {
		int n = l.X - u.X + 1;
		ans.push_back({ u, {n - 1, n - 1} });
		++u.X;
		++u.Y;
	}
	while (p.X != u.X && p.Y != l.Y) {
		int n = l.X - u.X + 1;
		ans.push_back({ {u.X, l.Y}, {n - 1, 1 - n} });
		++u.X;
		--l.Y;
	}
	while (p.X != l.X && p.Y != u.Y) {
		int n = l.X - u.X + 1;
		ans.push_back({ {l.X, u.Y}, {1 - n, n - 1} });
		--l.X;
		++u.Y;
	}
	while (p.X != l.X && p.Y != l.Y) {
		int n = l.X - u.X + 1;
		ans.push_back({ l, {1 - n, 1 - n} });
		--l.X;
		--l.Y;
	}
}
vector<Angle> find_ans(const int n, const pii p) {
	vector<Angle> ans;
	push_ans({ 1, 1 }, { n, n }, p, ans);
	return ans;
}
bool solve_test() {
	int n;
	pii p;
	if (!(cin >> n >> p.X >> p.Y))
		return false;
	vector<Angle> ans = find_ans(n, p);
	cout << "Yes\n";
	cout << ans.size() << '\n';
	for (const Angle& a : ans)
		cout << a.t.X << ' ' << a.t.Y << ' ' << a.d.X << ' ' << a.d.Y << '\n';
	return true;
}
void solve_tests() {
	while (solve_test());
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
#ifdef ONPC
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	solve_tests();
}