#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double

void solve() {
	
	int n , x , y; cin >> n >> x >> y;
	
	vector<array<int , 4>> ret;
	int p1 = -1 , p2 = -1;
	for(int i = 1 ; i <= n ; i++){
		if(i == x || i == y){
			p1 = i;
			break;
		}
		ret.push_back({i , i , n - i , n - i});
	}
	for(int i = n ; i >= 1 ; i--){
		if(i == x || i == y){
			p2 = i;
			break;
		}
		ret.push_back({i , i , -(i - p1) , -(i - p1)});
	}
	
	int SIZE = n - ret.size();
	vector<pair<int , int>> si;
	si.push_back({p1 , p1});
	si.push_back({p2 , p2});
	si.push_back({p1 , p1 + SIZE - 1});
	si.push_back({p2 , p2 - SIZE + 1});
	if(x == si[0].first){
		if(y == si[0].second){
			for(int i = si[1].first ; i > si[0].first ; i--){
				SIZE--;
				ret.push_back({i , i , -SIZE , -SIZE});
			}
		}
		else {
			for(int i = si[3].first , j = si[3].second ; i > si[0].first ; i-- , j++){
				SIZE--;
				ret.push_back({i , j , -SIZE , SIZE});
			}
		}
	}
	else {
		if(y == si[1].second){
			for(int i = si[0].first ; i < si[1].first ; i++){
				SIZE--;
				ret.push_back({i , i , SIZE , SIZE});
			}
		}
		else {
			for(int i = si[2].first , j = si[2].second ; i < si[0].first ; i++ , j--){
				SIZE--;
				ret.push_back({i , j , SIZE , -SIZE});
			}
		}
	}
	
	cout << "Yes\n";
	cout << ret.size() << '\n';
	for(auto [nx , ny , h , w] : ret){
		cout << nx << ' ' << ny << ' ' << h << ' ' << w << '\n';
	}
	
}

int main(){
	ios::sync_with_stdio(false);
    cin.tie(0);
   	
    int __ = 1;
    //cin >> __;
    
	while(__--){
   		solve();
   	}
    return 0;
}