Problem - Cut and Paste

Given a string of $n$ characters and $q$ operations: move the substring from position $l$ to $r$ to the end. Constraints: $n, q \leq 2 \cdot 10^5$. Regular arrays would require $O(n)$ per operation. With implicit treaps, each operation is $O(\log n)$:

$1.$ Split to extract $[l, r]$

$2.$ Merge the extracted piece at the end Before reading the solution, think about how you'd implement this with three splits and two merges.