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

const int N=2e5+5;
int n,m;
string S;

struct Nod{
  int x;
  ll v;
};

namespace SGT{
  #define mid ((l+r)>>1)
  #define lc p<<1
  #define rc p<<1|1
  #define lson l,mid,lc
  #define rson mid+1,r,rc
  
  ll tr[N<<2];
  int tg[N<<2];
  
  void pt(int p,int v){tr[p]=tr[p]*(1ll<<v),tg[p]+=v;}
  void pd(int p){
    if(!tg[p]) return;
    pt(lc,tg[p]),pt(rc,tg[p]),tg[p]=0;
  }
  void pu(int p){tr[p]=tr[lc]+tr[rc];}
  void upd(int l,int r,int p,int x,ll v){
    if(l==r) return tr[p]+=v,void();
    pd(p);
    x<=mid?upd(lson,x,v):upd(rson,x,v);pu(p);
  }
  Nod find(int l,int r,int p,ll v){
    if(l==r) return {l,tr[p]};
    pd(p);
    if(tr[lc]>=v) return find(lson,v);
    auto res=find(rson,v-tr[lc]);
    res.v+=tr[lc];
    return res;
  }
  void build(int l,int r,int p){
    if(l==r) return tr[p]=1,void();
    build(lson),build(rson),pu(p);
  }
  void chg(int l,int r,int p,int x,int y){
    if(x>y||x>r||y<l) return;
    if(x<=l&&y>=r) return pt(p,1);
    pd(p);
    if(x<=mid) chg(lson,x,y);
    if(y>mid) chg(rson,x,y);
    pu(p);
  }
}

int main(){
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  cin>>n>>m>>S;
  SGT::build(1,n,1);
  
  while(m--){
    int op,l,r,x;
    cin>>op;
    if(op==1){
      cin>>l>>r;
      auto fi=SGT::find(1,n,1,l),se=SGT::find(1,n,1,r);
      SGT::chg(1,n,1,fi.x+1,se.x);
      if(fi.x==se.x){
        SGT::upd(1,n,1,fi.x,r-l+1);
      }else{
        SGT::upd(1,n,1,fi.x,fi.v-l+1);
        SGT::upd(1,n,1,se.x,se.v-r);
      }
    }else{
      cin>>x;
      auto pos=SGT::find(1,n,1,x);
      cout<<S[pos.x-1]<<'\n';
    }
  }
  return 0;
}