#include <bits/stdc++.h>
#define X first
#define Y second
#define PB push_back

using namespace std;

typedef vector<int> vi;
typedef long long ll;
typedef pair < int, ll > pil;

const int N = 2e5 + 500;
const int OFF = (1 << 18);

int n, q;
ll T[2 * OFF];
int prop[2 * OFF];
char s[N];

void refresh(int i) {
	if(!prop[i]) return;
	T[i] <<= prop[i];
	if(i < OFF) {
		prop[2 * i] += prop[i];
		prop[2 * i + 1] += prop[i];
	}
}

void update(int i, int a, int b, int lo, int hi) {
	if(lo <= a && b <= hi) {
		prop[i]++; refresh(i); return;
	}
	refresh(i);
	if(a > hi || b < lo) return;
	update(2 * i, a, (a + b) / 2, lo, hi);
	update(2 * i + 1, (a + b) / 2 + 1, b, lo, hi);
	T[i] = T[2 * i] + T[2 * i + 1];
}

pil find_index(int i, ll kol) {
	if(!(i - 1)) refresh(i);
	if(i >= OFF) return {i - OFF, kol};
	refresh(2 * i); refresh(2 * i + 1);
	if(T[2 * i] <= kol) return find_index(2 * i + 1, kol - T[2 * i]);
	return find_index(2 * i, kol);
}

void postavi(int i, int a, int b, int pos, ll kol) {
	if(!(i - 1)) refresh(i);
	if(a == b) {
		T[i] = kol;
		return;
	}
	refresh(2 * i); refresh(2 * i + 1);
	if(pos <= (a + b) / 2) postavi(2 * i, a, (a + b) / 2, pos, kol);
	else postavi(2 * i + 1, (a + b) / 2 + 1, b, pos, kol);
	T[i] = T[2 * i] + T[2 * i + 1];
	
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> q;
	for(int i = 0;i < n;i++) {
		cin >> s[i];
		T[OFF + i] = 1;
	}
	for(int i = OFF - 1; i ; i--) T[i] = T[2 * i] + T[2 * i + 1];
	for(;q--;) {
		int ty; cin >> ty;
		if(ty == 2) {
			ll pos; cin >> pos; pos--;
			cout << s[find_index(1, pos).X] << '\n';
		} else {
			ll l, r; cin >> l >> r; l--, r--;
			pil L = find_index(1, l);
			pil R = find_index(1, r);
			if(L.X == R.X) {
				postavi(1, 0, OFF - 1, L.X, T[OFF + L.X] + (r - l + 1));
			} else {
				postavi(1, 0, OFF - 1, L.X, 2 * T[OFF + L.X] - L.Y);
				postavi(1, 0, OFF - 1, R.X, T[OFF + R.X] + R.Y + 1);
				update(1, 0, OFF - 1, L.X + 1, R.X - 1);
			}
		}
	}
	return 0;
}