CodeForces - 1088C Ehab and a 2-operation task（构造，模性质）

int mx=2e5;
int a[MX];
inline void solve()
{
    int n;cin>>n;
    rpp(i,n) cin>>a[i];
    cout<<n+1<<endl;
    cout<<1<<" "<<n<<" "<<mx<<endl;
    rpp(i,n)   cout<<2<<" "<<i<<" "<<a[i]+mx-i<<endl;
}