#ifndef DEBUG
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast,unroll-loops")
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define vc vector
#define ll long long
using namespace std;
using namespace atcoder;
constexpr int INF = 5e5 + 1;
vector<int> g[INF];
int ans1[INF];
int ans2[INF];
void solve()
{
	int n, q;
	scanf("%d %d", &n, &q);
	dsu DSU(n);
	rep(i, n) g[i].push_back(i);
	rep(qqqqq, q)
	{
		int ty, a, b;
		scanf("%d %d %d", &ty, &a, &b);
		a--;
		if (ty == 1)
		{
			a = DSU.leader(a);
			b = DSU.leader(b - 1);
			if (a == b)
				continue;
			const int c = DSU.merge(a, b);
			const int d = a ^ b ^ c;
			for (int i : g[d])
			{
				ans2[i] += ans1[d] - ans1[c];
				g[c].push_back(i);
			}
			ans1[d] = 0;
			g[d].clear();
		}
		else if (ty == 2)
			ans1[DSU.leader(a)] += b;
		else
			printf("%d\n", ans2[a] + ans1[DSU.leader(a)]);
	}
}
int main()
{
	solve();
	return 0;
}