Frog Sort

There are $N$ frogs (numbered $1$ through $N$) in a line. For each valid $i$, the $i$-th frog is initially at the position $i$, it has weight $W_i$, and whenever you hit its back, it jumps a distance $L_i$ to the right, i.e. its position increases by $L_i$. The weights of the frogs are pairwise distinct. You can hit the back of each frog any number of times (possibly zero, not necessarily the s