Mickey Mouse's Friends
One day, Mickey Mouse's friends gathered to play a game. Each friend is assigned a unique number, with Mickey Mouse himself being number 0. Initially, Mickey wrote down several numbers in a sequence on a piece of paper. The game then begins, allowing two types of operations in a single move:
A friend with number X copies all the numbers from a friend with number Y in the same order (assuming friend Y already has a list of numbers), but modifies one of the numbers by a specific value.
Calculate the sum of numbers over a specified segment for friend X.
Since all of Mickey Mouse's friends are quite lazy, Mickey Mouse asks you to play the game on their behalf.
Each friend copies another friend's numbers exactly 1 time and makes their modification.
Input
The first line contains the number N (1 ≤ N ≤ 10^5)—the count of numbers Mickey Mouse initially wrote down. The following line lists these N numbers (-10^4 ≤ A_i ≤ 10^4).
The next line contains the number M (1 ≤ M ≤ 10^5)—the number of friends. The subsequent line contains the number Q (1 ≤ Q ≤ 10^5)—the number of moves in the game. The following Q lines describe each move in the format:
0 X Y u v—friend X copies numbers from friend Y, and the number at index u (using a 1-indexed array) is adjusted by v (0 ≤ X, Y ≤ M, X ≠ Y, 1 ≤ u ≤ N, -10^4 ≤ v ≤ 10^4). All numbers are integers.
1 X l r—compute the sum for friend X over the range from l to r (0 ≤ X ≤ M, 1 ≤ l ≤ r ≤ N).
Output
For each query of type 1, output the result or "Nothing" (without quotes) if the friend has not yet copied any numbers.