#include<bits/stdc++.h>

using namespace std;
// #define endl '\n'
// #define int long long

long long M = 998244353;
typedef long long LL;
typedef pair<int, int> PII;

int n;

int m[1010][1010];

void solve() {
	cin >> n;
	int a, b;
	cin >> a >> b;
	cout << "Yes" << endl;

	cout << n - 1 << endl;
	int idx = 1;
	int aa = a - 1, bb = b + 1;
	while(aa > 0 && bb <= n) {
		cout << aa << ' ' << bb << ' ' << idx << ' ' << -1 * idx << endl;
		for(int i = 0; i <= idx; i++) {
			m[aa + i][bb] = 1;
			m[aa][bb - i]  = 1;
		}
		idx++;
		aa--;
		bb++;
	}
	aa = a + 1, bb = b - 1;

	while(aa <= n && bb > 0) {
		cout << aa << ' ' << bb << ' '<< -1 *idx << ' ' << idx << endl;
		for(int i = 0; i <= idx; i++) {
			m[aa - i][bb] = 1;
			m[aa][bb + i] = 1;
		}
		idx++;
		aa++;
		bb--;
	}
	if(!m[1][1]) {
		for(int i = 1; i <= n; i++) {
			if(i != a && !m[i][i] ) {
				cout << i << ' ' << i << ' ' << n - i << ' ' << n - i << endl;
			}
		}

	}
	else {
		for(int i = 1; i <= n; i++) {
			if(i != a) {
				cout << i << ' ' << i << ' ' << i - 1 << ' ' << i - 1 << endl;
			}
		}
	}



}

int main() {
	int t;
	// cin >> t;
	t = 1;
	while(t--) {
		//cout << "in\n";
		solve();}



}