The Most Amazing Dish

Chef has recently learnt about the most amazing dish. The recipe for this dish lists two sequences $A_1, A_2, \ldots, A_N$ and $B_1, B_2, \ldots, B_N$, and $Q$ tasks. Chef noticed that there are only three types of tasks: 1. `Z Y`: set $B_Z = Y$ 2. `L R X`: for each $i$ such that $L \le i \le R$, set $A_i = B_{X+i-L}$ 3. `L R`: compute the sum $A_L + A_{L+1} + \ldots + A_R$ Chef must perform all