#define LOCAL
#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'
#define int long long
#ifdef LOCAL
#define FINISH cerr << "FINISH" << endl;
#else
#define FINISH ;
#endif

#ifdef LOCAL
#define debug(x) cerr << setw(4) << #x << " == " << x << endl
#else
#define debug(x)
#endif

#ifdef LOCAL
#define debugv(x)                   \
    cerr << setw(4) << #x << ":: "; \
    for (auto i : x)                \
        cerr << i << " ";           \
    cerr << endl
#else
#define debugv(x)
#endif

using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
ostream& operator<<(ostream& out, PII& x)
{
    out << x.fir << " " << x.sec << endl;
    return out;
}

const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 200020;

struct segtree {
	int l, r;
	ll tag, sum;
}t[N << 2];

void pushup(int p) {
	t[p].sum = t[p << 1].sum + t[p << 1 | 1].sum;
}

void pushdown(int p) {
	if (t[p].tag == 1) {
		return;
	}
	t[p << 1].sum = t[p << 1].sum * t[p].tag;
	t[p << 1 | 1].sum = t[p << 1 | 1].sum * t[p].tag;
	t[p << 1].tag *= t[p].tag;
	t[p << 1 | 1].tag *= t[p].tag;
	t[p].tag = 1;
}

void build (int p, int l, int r) {
	t[p].l = l, t[p].r = r, t[p].tag = 1;
	if (l == r) {
		t[p].sum = 1;
		return;
	}
	int mid = (l + r) >> 1;
	build (p << 1, l, mid);
	build(p << 1 | 1, mid + 1, r);
	pushup(p);
}

void modifylr(int p, int l, int r) {
	if (l <= t[p].l && t[p].r <= r) {
		t[p].tag *= 2;
		t[p].sum *= 2;
		return;
	}
	pushdown(p);
	if (l <= t[p << 1].r)
		modifylr(p << 1, l, r);
	if (r >= t[p << 1 | 1].l)
		modifylr(p << 1 | 1, l, r);
	pushup(p);
}

void modifyp(int p, int x, ll val) {
	if (t[p].l == t[p].r) {
		t[p].sum += val;
		return;
	}
	pushdown(p);
	if (x <= t[p << 1].r)
		modifyp(p << 1, x, val);
	if (x >= t[p << 1 | 1].l)
		modifyp(p << 1 | 1, x, val);
	pushup(p);
}

int getpl(int p, ll sum) {
	// cout << p << " " << sum << endl;
	if (t[p].l == t[p].r) {
		// cout << "!" << endl;
		return t[p].l;
	}
	pushdown(p);
	ll sum1 = t[p << 1].sum;
	if (sum1 >= sum)
		return getpl(p << 1, sum);
	else 
		return getpl(p << 1 | 1, sum - sum1);
	pushup(p);
}

ll getsum(int p, int l, int r) {
	if (l <= t[p].l && t[p].r <= r) {
		return t[p].sum;
	}
	pushdown(p);
	ll ans = 0;
	if (l <= t[p << 1].r)
		ans += getsum(p << 1, l, r);
	if (r >= t[p << 1 | 1].l)
		ans += getsum(p << 1 | 1, l, r);
	pushup(p);
	return ans;
}

void solve()
{
	int n, q;
	cin >> n >> q;
	string s;
	cin >> s;
	s = " " + s;
	build(1, 1, n);

	while (q--) {
		int inp;
		ll l, r, x;
		cin >> inp;
		if (inp == 1) {
			cin >> l >> r;
			int bl = getpl(1, l);
			int br = getpl(1, r);
			// cout << l << " " << r << " "<< bl << " " << br << endl;
			if (bl == br) {
				modifyp(1, bl, (r - l + 1));
			}
			else {
				ll len1 = getsum(1, 1, bl);
				ll len2 = getsum(1, 1, br - 1);

				modifyp(1, bl, len1 - l + 1);
				modifyp(1, br, r - len2);
				if (bl + 1 != br - 1) 
					modifylr(1, bl + 1, br - 1);
			}
		}
		else {
			cin >> x;
			// cout << getpl(1, x) << " ";
			cout << s[getpl(1, x)] << el;
		}
	}
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}