You are given a complete binary tree with n nodes. The root node is numbered 1, and node x's father node is $\left \lfloor x/2 \right \rfloor$. At the beginning, node x has a value of exactly x. We define the value of a path as the sum of all nodes it passes(including two ends, or one if the path only has one node). Now there are two kinds of operations:
1.  change u x Set node u's value as x(1=<u<=n;1=<x<=10^10)
2.  query u Query the max value of all paths which passes node u.

There are multiple cases.
For each case:
The first line contains two integers n,m(1=<n<=10^8,1=<m<=10^5), which represent the size of the tree and the number of operations, respectively.
Then m lines follows. Each line is an operation with syntax described above.

For each query operation, output an integer in one line, indicating the max value of all paths which passes the specific node.