#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <map>
#include <set>
#include <bitset>
#include <ctime>
#include <cassert>
#include <complex>

const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3fll;
#define memset0(x) memset(x, 0, sizeof(x))
#define memsetM1(x) memset(x, -1, sizeof(x))
#define memsetINF(x) memset(x, INF, sizeof(x))

using namespace std;

int n, bi, bj;

vector<tuple<int, int, int, int>> anss;

void solve(int n, int ii, int jj, int di, int dj)
{
	if (n == 1)
	{
		return;
	}
	if (max(ii, jj) < n)
	{
		for (int i = max(ii, jj) + 1; i <= n; i++)
		{
			anss.push_back({ i + di, i + dj, -(i - 1), -(i - 1) });
		}
		solve(max(ii, jj), ii, jj, di, dj);
		return;
	}
	
	
	if (ii == 1)
	{
		for (int i = 1; i < n; i++)
		{
			anss.push_back({ n + 1 - i + di, i + di, -(n - i), (n - i) });
		}
	}
	else if (jj == 1)
	{
		for (int i = 1; i < n; i++)
		{
			anss.push_back({ i + di, n + 1 - i + di, (n - i), -(n - i) });
		}
	}
	else
	{
		for (int i = 1; i <= min(ii, jj) - 1; i++)
		{
			anss.push_back({ i + di, i + dj, (n - i), (n - i) });
		}
		int tmp = min(ii, jj) - 1;
		solve(n - tmp, ii - tmp, jj - tmp, di + tmp, dj + tmp);
	}
}

int main()
{
//#ifndef ONLINE_JUDGE
//	freopen("test.in", "r", stdin);
//	freopen("test.out", "w", stdout);
//	int startTime = clock();
//#endif
	cin >> n >> bi >> bj;
	solve(n, bi, bj, 0, 0);
	cout << "Yes" << endl;
	cout << anss.size() << endl;
	for (auto& tp : anss)
	{
		printf("%d %d %d %d\n", get<0>(tp), get<1>(tp), get<2>(tp), get<3>(tp));
	}


#ifndef ONLINE_JUDGE
	printf("Time = %dms\n", clock() - startTime);
#endif
	return 0;
}