    /**   Created by: Humberto Yusta
          Codeforces User: humbertoyusta
          Country: Cuba
          Copyright��                    */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas:
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
//#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
//#pragma GCC target("avx2") //Enable AVX
/// Macros:
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
typedef pair<int,int> ii;
typedef long double ld;
typedef unsigned long long ull;
/// Constraints:
const int maxn = 1000010;
const int mod = 1000000007;
const int mod2 = 998244353;
const ld eps = 1e-9;
const int inf = ((1ll<<31ll)-1ll);
const int INF = 1ll * mod * mod;
const ld pi = acos(-1);
/// Prime Numbers:
// 2, 173, 179, 181, 197, 311, 331, 737, 1009, 2011, 2027, 3079, 4001, 10037, 10079, 20011, 20089;
// 100003, 100019, 100043, 200003, 200017, 1000003, 1000033, 1000037, 1000081;
// 2000003, 2000029, 2000039, 1000000007, 1000000021, 2000000099;
/// rng
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/// Functions:
#define lg2(x) 31 - __builtin_clz(x)
#define lgx(x,b) ( log(x) / log(b) )
/// Red-Black Tree Template ---------------------------------
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree < long long ,  null_type ,  less<long long> ,  rb_tree_tag ,  tree_order_statistics_node_update > ordered_set;
/// Quick Pow------------------------------------------------
int qpow(int b,int e){
    if( !e ) return 1;
    if( e & 1 ) return qpow(b,e-1) * b % mod;
    int pwur = qpow(b,e>>1);
    return pwur * pwur % mod;
}
int modinv(int x){
    return qpow(x,mod-2);
}
/// My Code -------------------------------------------------

int n, L, R, p[maxn], mk[maxn], sp[maxn];
vector<pair<ii,int>> ans;

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cout.setf(ios::fixed); cout.precision(0);
    srand(time(NULL));

    //freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);

    cin >> L >> R;

    n = 32;

    for(int i=1; i<n; i++)
        sp[i] = mod;

    p[0] = 1;
    p[1] = 1;
    for(int i=2; i<=32; i++)
        p[i] = p[i-1] * 2ll;

    ans.pb({{1,n},L});
    int curr = L;
    for(int i=n-1; i>1; i--){
        if( curr == R ) continue;
        ans.pb({{1,i},L});
        int tmpcurr = curr;
        for(int j=i+1; j<=n; j++){
            if( tmpcurr + p[n-j] <= R ){
                mk[j] = 1;
                tmpcurr += p[n-j];
            }
            else{
                mk[j] = 0;
            }
        }
        for(int j=n; j>i; j--){
            if( mk[j] ){
                ans.pb({{i,j},curr-(L)-(sp[j])+1});
                curr += p[n-j];
                sp[i] = min( sp[i] , sp[j] + ans.back().s );
            }
        }
    }

    //db(curr)
    if( curr == R ){
        cout << "YES\n";
        cout << n << ' ' << ans.size() << '\n';
        for( auto i : ans ){
            cout << i.f.f << ' ' << i.f.s << ' ' << i.s << '\n';
        }
    }
    else{
        cout << "NO\n";
    }

    return 0;
}
