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 <iostream>
#include <vector>
using namespace std;
struct WeightUnionFind{
	//
	vector<int> ran,par,wei;
	//
	WeightUnionFind(int n=1){
		init(n);
	}
	//
	void init(int n=1){
		for(int i=0;i<n;i++){
			par.push_back(i);
			ran.push_back(0);
			wei.push_back(0);
		}
	}
	//
	int find(int x){
		if(par[x]==x){
			return x;
		}else{
			int r=find(par[x]);
			wei[x]+=wei[par[x]];
			return par[x]=r;
		}
	}
	//
	int weight(int x){
		find(x);
		return wei[x];
	}
	//
	bool same(int x,int y){
		return find(x)==find(y);
	}
	//
	bool unite(int x,int y,int w){
		w+=weight(x);
		w-=weight(y);
		x=find(x);
		y=find(y);
		if(x==y){
			return false;
		}else if(ran[x]<ran[y]){
			swap(x,y);
			w=-w;
		}else if(ran[x]==ran[y]){
			ran[x]++;
		}
		par[y]=x;
		wei[y]=w;
		return true;
	}
	//
	int diff(int x,int y){
		return weight(y)-weight(x);
	}
	//
};
int main(){
	int N,Q;
	cin>>N>>Q;
	WeightUnionFind UF(N);
	while(Q--){
		int C;
		cin>>C;
		if(C==1){
			int X,Y;
			cin>>X>>Y;
			if(UF.same(X,Y)){
				cout<<UF.diff(X,Y)<<endl;
			}else{
				cout<<"?"<<endl;
			}
		}else{
			int X,Y,Z;
			cin>>X>>Y>>Z;
			UF.unite(X,Y,Z);
		}
	}
	return 0;
}