#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<bitset>
#include<ctime>
#include<time.h>
#include<deque>
#include<stack>
#include<functional>
#include<sstream>
//#include<cctype>
//#pragma GCC optimize(2)
using namespace std;
#define maxn 2000005
#define inf 0x7fffffff
//#define INF 1e18
#define rdint(x) scanf("%d",&x)
#define rdllt(x) scanf("%lld",&x)
#define rdult(x) scanf("%lu",&x)
#define rdlf(x) scanf("%lf",&x)
#define rdstr(x) scanf("%s",x)
#define mclr(x,a) memset((x),a,sizeof(x))
typedef long long  ll;
typedef unsigned long long ull;
typedef unsigned int U;
#define ms(x) memset((x),0,sizeof(x))
const long long int mod = 1e9 + 7;
#define Mod 1000000000
#define sq(x) (x)*(x)
#define eps 1e-5
typedef pair<int, int> pii;
#define pi acos(-1.0)
//const int N = 1005;
#define REP(i,n) for(int i=0;i<(n);i++)
typedef pair<int, int> pii;inline int rd() {int x = 0;char c = getchar();bool f = false;while (!isdigit(c)) {if (c == '-') f = true;c = getchar();}while (isdigit(c)) {x = (x << 1) + (x << 3) + (c ^ 48);c = getchar();}return f ? -x : x;
}ll gcd(ll a, ll b) {return b == 0 ? a : gcd(b, a%b);
}
int sqr(int x) { return x * x; }/*ll ans;
ll exgcd(ll a, ll b, ll &x, ll &y) {if (!b) {x = 1; y = 0; return a;}ans = exgcd(b, a%b, x, y);ll t = x; x = y; y = t - a / b * y;return ans;
}
*/int n, m;
int rt[maxn];
int a[1000004];
struct node {int val[maxn * 10], ls[maxn * 10], rs[maxn * 10];int tot = 0;inline void build(int &o, int l, int r) {o = ++tot;if (l == r) {val[o] = a[l]; return;}int mid = (l + r) >> 1;build(ls[o], l, mid); build(rs[o], mid + 1, r);}inline void upd(int &o, int pre, int l, int r, int Val,int x) {o = ++tot; val[o] = val[pre]; ls[o] = ls[pre]; rs[o] = rs[pre];if (l == r) {val[o] = Val; return;}int mid = (l + r) >> 1;if (x <= mid)upd(ls[o], ls[pre], l, mid, Val, x);else upd(rs[o], rs[pre], mid + 1, r, Val, x);}inline int query(int o, int l, int r, int x) {if (l == r)return val[o];int mid = (l + r) >> 1;if (x <= mid)return query(ls[o], l, mid, x);else return query(rs[o], mid + 1, r, x);}
}seg;int main()
{// ios::sync_with_stdio(0);n = rd(); m = rd();for (int i = 1; i <= n; i++)a[i] = rd();seg.build(rt[0], 1, n);for (int i = 1; i <= m; i++) {int V = rd(), opt = rd(), loc = rd();if (opt == 1) {int vu = rd();seg.upd(rt[i], rt[V], 1, n, vu, loc);}else {int ans = seg.query(rt[V], 1, n, loc);printf("%d\n", ans); rt[i] = rt[V];}}return 0;
}