#include<bits/stdc++.h>
using namespace std;
long long n,q,opt,i,j,k;
int main(){
	cin>>n>>q;
	vector <vector<int> >locker(n+1);
	while(q--){
		cin>>opt;
		if(opt==1){
			cin>>i>>j>>k;
			if(locker[i].size()<j+1)
				locker[i].resize(j+1);
				}else{
			cin>>i>>j; 
			cout<<locker[i][j]<<endl;
		}	locker[i][j]=k;

	}
	return 0;
}