1480E.Coninuos City（构造）

#include<bits/stdc++.h>
using namespace std;
const int maxn=1010;
int L,R;
vector<pair<pair<int,int> ,int> > ans;
int f[maxn];
int main () {
    f[0]=1;
    for (int i=1;i<=30;i++) f[i]=f[i-1]*2;
    cin>>L>>R;
    int n=22;
    for (int i=2;i<=n;i++) ans.push_back(make_pair(make_pair(1,i),L));
    for (int i=2;i<=20;i++) {
        for (int j=i+1;j<n;j++) {
            ans.push_back(make_pair(make_pair(i,j),f[i-2]));
        }
    } 
    int t=(R-L);
    for (int i=2;i<=21;i++) {
        if (t>>(i-2)&1) {
            t^=(1<<(i-2));
            ans.push_back(make_pair(make_pair(i,n),t+1));
        }
    }
    printf("YES\n%d %d\n",n,ans.size());
    for (auto it:ans) printf("%d %d %d\n",it.first.first,it.first.second,it.second);
}