#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define pb push_back
#define mp make_pair
const int N = 250000 + 3;
int sub, n, q;
vector<int> arr;
int main(){
	cin>>sub>>n>>q;
	arr.resize(n);
	for(int i = 0; i < n; i++)	cin>>arr[i];
	bitset<N> now, tmp;
	now[0] = 1;
	while(q--){
		int t;
		cin>>t;
		if(t == 1){
			int l, r;
			cin>>l>>r;
			l--; r--;		
			tmp.set();
			tmp >>= l;
			tmp <<= (N - r + l);
			tmp >>= (N - r);
			tmp &= now;
			tmp <<= 1;
			now ^= tmp;
		}
		else{
			int l;
			cin>>l;
			l--;
			if(now[l] == 1) cout<<arr[0]<<"\n";
			else cout<<0<<"\n";
		}
	}
	for(int i = 0; i < n; i++){
		cout<<(now[i] ? arr[0] : 0)<<"\n";
	}
}