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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define inf 1000000000
#define mod 1000000007
int par[111111],ran[111111],diff_weight[111111];
void init(int n){
	rep(i,n){
		par[i]=i;
		ran[i]=0;
		diff_weight[i]=0;
	}
}
int find(int x){
	if(par[x]==x)return x;
	int r=find(par[x]);
	diff_weight[x]+=diff_weight[par[x]];
	return par[x]=r;
}
int weight(int x){
	find(x);
	return diff_weight[x];
}
bool same(int x,int y){
	return find(x)==find(y);
}
void unite(int x,int y,int w){
	w+=weight(x);
	w-=weight(y);
	x=find(x);
	y=find(y);
	if(x==y)return;
	if(ran[x]<ran[y]){
		swap(x,y);
		w*=-1;
	}
	if(ran[x]==ran[y])ran[x]++;
	par[y]=x;
	diff_weight[y]=w;
}
int diff(int x,int y){
	if(same(x,y))return weight(y)-weight(x);
	return inf;
}
int n,q;
int x,a,b,c;
signed main(){
	cin>>n>>q;
	init(n);
	while(q--){
		cin>>x;
		if(x==0){
			cin>>a>>b>>c;
			unite(a,b,c);
		}
		else{
			cin>>a>>b;
			if(diff(a,b)==inf)puts("?");
			else cout<<diff(a,b)<<endl;
		}
	}
	return 0;
}