#include <iostream>
#include <algorithm>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdio>
#include <string>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define fin(a,n) for(int i = a; i < n; i++)
#define fjn(a,n) for(int j = a; j < n; j++)
#define all(a) a.begin(),a.end()
#define allr(a) a.rbegin(),a.rend()
#define FAST ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace std;
void solve()
{
int n; cin >> n;
string s; cin >> s;
int q, change = 0; cin >> q;
while(q--){
int x, y; cin >> x >> y;
if(x == 1){
change += y;
change %= n;
}
else{
--y; cout << s[(y+change)%n] << '\n';
}
}
}
int main()
{
FAST;
int tt = 1; cin >> tt;
while (tt--){
solve();
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8aW9tYW5pcD4KI2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNpbmNsdWRlIDxjc3RkaW8+CiNpbmNsdWRlIDxzdHJpbmc+CiNkZWZpbmUgbGwgbG9uZyBsb25nCiNkZWZpbmUgbGQgbG9uZyBkb3VibGUKI2RlZmluZSBzdCBmaXJzdAojZGVmaW5lIG5kIHNlY29uZAojZGVmaW5lIHBiIHB1c2hfYmFjawojZGVmaW5lIGZpbihhLG4pIGZvcihpbnQgaSA9IGE7IGkgPCBuOyBpKyspCiNkZWZpbmUgZmpuKGEsbikgZm9yKGludCBqID0gYTsgaiA8IG47IGorKykKI2RlZmluZSBhbGwoYSkgYS5iZWdpbigpLGEuZW5kKCkKI2RlZmluZSBhbGxyKGEpIGEucmJlZ2luKCksYS5yZW5kKCkKI2RlZmluZSBGQVNUIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpLCBjaW4udGllKG51bGxwdHIpLCBjb3V0LnRpZShudWxscHRyKQoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnZvaWQgc29sdmUoKQp7CiAgICBpbnQgbjsgY2luID4+IG47CiAgICBzdHJpbmcgczsgY2luID4+IHM7CiAgICBpbnQgcSwgY2hhbmdlID0gMDsgY2luID4+IHE7CiAgICB3aGlsZShxLS0pewogICAgICAgIGludCB4LCB5OyBjaW4gPj4geCA+PiB5OwogICAgICAgIGlmKHggPT0gMSl7CiAgICAgICAgICAgIGNoYW5nZSArPSB5OwogICAgICAgICAgICBjaGFuZ2UgJT0gbjsKICAgICAgICB9CiAgICAgICAgZWxzZXsKICAgICAgICAgICAtLXk7IGNvdXQgPDwgc1soeStjaGFuZ2UpJW5dIDw8ICdcbic7CiAgICAgICAgfQogICAgfQp9CgppbnQgbWFpbigpCnsKICAgIEZBU1Q7CgogICAgaW50IHR0ID0gMTsgY2luID4+IHR0OwogICAgd2hpbGUgKHR0LS0pewogICAgICAgIHNvbHZlKCk7CiAgICB9CiAgICByZXR1cm4gMDsKfQo=