Haha likes trees very much. Recently he discovered an interesting tree. The tree consists of n nodes numbered from 1 to n, each node i have an initial value 0. The root of the tree is node 1.
This tree has a special property: when a value val is added to a value of node i, for the all nodes in the subtree of i, if (deep[j] - deep[i]) % 2 == 0, add val to the value of j, otherwise add val - k * (deep[j] - deep[i]) to the value of j.
This tree supports two types of queries:
"1 x val k" — val is added to the value of node x;
"2 x" — print the current value of node x.
In order to help Haha understand the tree better, you must answer m queries of the preceding type.