#include <cstring>

 #include <iostream>

 #include <cstdio>

 #include <string>

 #include <cmath>

 using namespace std;

 char s[][];

 char str[];

 int n, block[], sz, cnt;

 void Build() {

     sz = sqrt(n);

     cnt = (n + sz - ) / sz; // 记得向上取整, 因为这WA了一次

     for(int i = ; i < n; i++) s[i / sz + ][block[i / sz + ]++] = str[i];

 }

 void Insert(char c, int p) {

     int i;

     for(i = ; i <= cnt; i++) {

         if(p - block[i] <= ) break;

         p -= block[i];

     }

     if(i == cnt + ) { s[cnt][block[cnt]++] = c; return ; }

     block[i]++;

     int len = strlen(s[i]);

     for(int j = len - ; j >= p - ; j--) s[i][j+] = s[i][j];

     s[i][p-] = c;

 }

 void Query(int p) {

     int i;

     for(i = ; i <= cnt; i++) {

         if(p - block[i] <= ) break;

         p -= block[i];

     }

     printf("%c\n", s[i][p-]);

 }

 int main() {

     scanf("%s", str); n = strlen(str);

     int q; scanf("%d", &q);

     Build();

     while(q--) {

         char op[], c[]; int num;

         scanf("%s", op);

         if(op[] == 'I') {

             scanf("%s%d", c, &num);

             Insert(c[], num);

         } else {

             scanf("%d", &num);

             Query(num);

         }

     }

     return ;

 }