Problem: There is a sequence $A = a_0, a_1, ..., a_{n-1}$. You are given the following information and questions.

* relate$(x, y, z)$: $a_y$ is greater than $a_x$ by $z$
* diff$(x, y)$: report the difference between $a_x$ and $a_y$ $(a_y - a_x)$

Constraints

* $2 \leq n \leq 100,000$
* $1 \leq q \leq 200,000$
* $0 \leq x, y < n$
* $x \ne y$
* $0 \leq z \leq 10000$
* There are no inconsistency in the given information

Input


$n \; q$
$query_1$
$query_2$
:
$query_q$


In the first line, $n$ and $q$ are given. Then, $q$ information/questions are given in the following format.


0 $x \; y\; z$


or


1 $x \; y$


where '0' of the first digit denotes the relate information and '1' denotes the diff question.

Output

For each diff question, print the difference between $a_x$ and $a_y$ $(a_y - a_x)$.

Example

Input

5 6
0 0 2 5
0 1 2 3
1 0 1
1 1 3
0 1 4 8
1 0 4


Output

2
?
10

Solution (in PYTHON3):

Solution:
import sys
input = sys.stdin.readline
class Union():
    def __init__(self, n):
        self.par = [i for  i in range(n+1)]
        self.rank = [0]*(n+1)
        self.weight = [0]*(n+1) #子から親までの距離
        
    def find(self, x):
        if self.par[x] == x:
            return x
        y = self.find(self.par[x])
        self.weight[x] += self.weight[self.par[x]]
        self.par[x] = y
        return y
    
    def union(self, x, y, w):
        rx = self.find(x)
        ry = self.find(y)
        if self.rank[rx] < self.rank[ry]:
            self.par[rx] = ry
            self.weight[rx] = w - self.weight[x] + self.weight[y]
        else:
            self.par[ry] = rx
            self.weight[ry] = -w - self.weight[y] + self.weight[x]
            if self.rank[rx] == self.rank[ry]:
                self.rank[rx] += 1
        
    def same(self, x, y):
        return (self.find(x) == self.find(y))
    
    #ｘからｙへの距離
    def diff(self, x, y):
        if self.same(x,y):
            return self.weight[x] - self.weight[y]
        else:return '?'

n ,q = map(int, input().split())
unite = Union(n)
for i in range(q):
    a, b, c, *d = map(int, input().split())
    if a == 0:unite.union(b,c,d[0])
    else:print(unite.diff(b,c))