#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 200005;
int n, q;
char str[N];

ll sum[N * 4], lz[N * 4];
void up(int now)
{
	sum[now] = sum[now << 1] + sum[now << 1 | 1];
}
void upd(int now, ll v)
{
	sum[now] *= v;
	lz[now] *= v;
}
void down(int now)
{
	if (lz[now] != 1)
	{
		upd(now << 1, lz[now]);
		upd(now << 1 | 1, lz[now]);
		lz[now] = 1;
	}
}
void build(int now, int l, int r)
{
	lz[now] = 1;
	sum[now] = r - l + 1;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(now << 1, l, mid);
	build(now << 1 | 1, mid + 1, r);
}
void chg(int now, int l, int r, ll ql, ll qr)
{
	if (ql <= 1 && qr >= sum[now])
	{
		upd(now, 2);
		return;
	}
	if (l == r)
	{
		sum[now] += min(qr, sum[now]) - max(ql, 1ll) + 1;
		return;
	}
	int mid = (l + r) >> 1;
	down(now);
	chg(now << 1 | 1, mid + 1, r, ql - sum[now << 1], qr - sum[now << 1]);
	chg(now << 1, l, mid, ql, qr);
	up(now);
}
int query(int now, int l, int r, ll p)
{
	if (l == r) return l;
	int mid = (l + r) >> 1;
	down(now);
	if (p <= sum[now << 1]) return query(now << 1, l, mid, p);
	else return query(now << 1 | 1, mid + 1, r, p - sum[now << 1]);
}

int main()
{
	scanf("%d%d", &n, &q);
	for (int i = 1; i <= n; i++)
		scanf(" %c", &str[i]);
	build(1, 1, n);
	int op;
	ll l, r;
	while (q--)
	{
		scanf("%d%lld", &op, &l);
		if (op == 1)
		{
			scanf("%lld", &r);
			chg(1, 1, n, l, r);
		}
		else
		{
			printf("%c\n", str[query(1, 1, n, l)]);
		}
	}
	return 0;
}