#include <bits/stdc++.h>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

struct BIT {
    int n;
    vi a;

    BIT(int n) : n(n), a(n+2) {}
    
    void add(int i, int x) {
        for(;i<=n;i+=i&-i) a[i]+=x;
    }

    int sum(int i) {
        int ans=0;
        for(;i;i-=i&-i) ans+=a[i];
        return ans;
    }
};

void solve() {
    string s1,s2;
    cin>>s1>>s2;
    int n=sz(s1);
    vector<int> sum(10);
    for(auto c:s1) sum[c-'0']++;
    vector bit(10,BIT(n));
    BIT bit2(n-1);
    for(int i=1;i<=n;i++) bit[s2[i-1]-'0'].add(i,1);
    for(int i=1;i<n;i++) bit2.add(i,s2[i-1]<s2[i]);
    int q;
    cin>>q;
    int mx=0;
    while(1<<(mx+1)<=n) mx++;
    while(q--) {
        int t;
        cin>>t;
        if(t==1) {
            int i,x;
            cin>>i>>x;
            bit[s2[i-1]-'0'].add(i,-1);
            if(i>1) bit2.add(i-1,-(s2[i-2]<s2[i-1]));
            if(i<n) bit2.add(i,-(s2[i-1]<s2[i]));

            s2[i-1]=(char)(x+'0');

            bit[s2[i-1]-'0'].add(i,1);
            if(i>1) bit2.add(i-1,(s2[i-2]<s2[i-1]));
            if(i<n) bit2.add(i,(s2[i-1]<s2[i]));
        }
        else {
            int i;
            cin>>i;
            int ans=0;
            vector<int> prev(10);
            for(int j=mx;j>=0;j--) {
                if(ans+(1<<j)>n) continue;
                auto cur=prev;
                for(int k=0;k<10;k++) cur[k]+=bit[k].a[ans+(1<<j)];

                auto ok = [&] {
                    for(int k=0;k<10;k++)
                        if(sum[k]<cur[k]) return false;
                    return true;
                    // if(ans+(1<<j)==n) return true;
                    // int next_bit = s2[ans+(1<<j)]-'0';
                    // for(int k=next_bit+1;k<10;k++)
                    //     if(sum[k]-cur[k]) return true;
                    // return false;
                };

                if(ok()) {
                    ans+=1<<j;
                    prev=cur;
                }
            }
            if(ans<n) {
                int next_bit=s2[ans]-'0';
                auto diff=sum;
                for(int j=0;j<10;j++) diff[j]-=prev[j];
                bool ok=false;
                for(int j=next_bit+1;j<10;j++)
                    if(diff[j]) {
                        ok=true;
                        break;
                    }
                if(!ok) {
                    int l=1,r=ans-1;
                    while(l<r) {
                        int mid=(l+r+1)>>1;
                        if(bit2.sum(ans-1)-bit2.sum(mid-1)) l=mid;
                        else r=mid-1;
                    }
                    ans=l-1;
                    if(ans==0) {
                        int first_bit = s2[0]-'0';
                        bool ok2=false;
                        for(int k=first_bit+1;k<10;k++)
                            if(sum[k]) ok2=true;
                        if(!ok2) {
                            cout<<"-1\n";
                            continue;
                        }
                    }
                }
            }
            if(i<=ans) cout<<s2[i-1]<<'\n';
            else {
                auto diff=sum;
                for(int j=0;j<10;j++) diff[j]-=bit[j].sum(ans);
                int remain=i-ans;
                int next_bit=s2[ans]-'0';
                int fi=0;
                for(int j=next_bit+1;j<10;j++)
                    if(diff[j]) {
                        diff[j]--;
                        remain--;
                        fi=j;
                        break;
                    }
                if(remain==0) {
                    cout<<fi<<'\n';
                    continue;
                }
                for(int j=0;j<10;j++) {
                    if(remain<=diff[j]) {
                        cout<<j<<'\n';
                        break;
                    }
                    else remain-=diff[j];
                }
            }
        }
    }
}

int main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int T = 1;
    // cin >> T;
    while (T--) solve();
}