#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
int n, m, cnt[15], c[100005][15];
char s1[100005], s2[100005];
int lowbit(int x) { return x & (-x); }
void Add(int id, int x, int val) {
    for (int i = x; i <= n; i += lowbit(i))
        c[i][id] += val;
}
int Query(int id, int x) {
    int res = 0;
    for (int i = x; i >= 1; i -= lowbit(i))
        res += c[i][id];
    return res;
}
bool chk(int x) {
    int cnt2[15];
    for (int i = 0; i <= 9; i++) {
        if(cnt[i] < Query(i, x))
            return false;
        cnt2[i] = cnt[i] - Query(i, x);
    }
    if(x == n)
        return true;
    int nw = x + 1;
    for (int i = 9; i >= 0; i--) {
        if(s2[nw] - '0' > i)
            return false;
        if(Query(i, nw + cnt2[i] - 1) - Query(i, nw - 1) < cnt2[i])
            return true;
        nw = nw + cnt2[i];
        if(nw == n + 1)
            return true;
    }
    return true;
}
int Ask(int pos) {
    if(!chk(0))
        return -1;
    int l = 0, r = n, ans = -1;
    while(l <= r) {
        int mid = (l + r) >> 1;
        if(chk(mid))
            l = mid + 1, ans = mid;
        else
            r = mid - 1;
    }
    // cout << "$ " << ans << endl;
    if(pos <= ans)
        return s2[pos] - '0';
    int cnt2[15];
    for (int i = 0; i <= 9; i++)
        cnt2[i] = cnt[i] - Query(i, ans);
    int val = s2[ans + 1] - '0';
    // cout << val << endl;
    for (int i = 0; i <= 9; i++)
        if(i > val && cnt2[i]) {
            --cnt2[i];
            val = i;
            break;
        }
    if (pos == ans + 1)
        return val;
    pos = pos - ans - 1;
    for (int i = 0; i <= 9; i++) {
        if(cnt2[i] >= pos)
            return i;
        pos -= cnt2[i];
    }
    return 9;
}
int main(){
    scanf("%s%s", s1 + 1, s2 + 1);
    n = strlen(s1 + 1);
    scanf("%d", &m);
    for (int i = 1; i <= n; i++)
        ++cnt[s1[i] - '0'];
    for (int i = 1; i <= n; i++)
        Add(s2[i] - '0', i, 1);
    while(m--) {
        int opt, l, x;
        scanf("%d%d", &opt, &l);
        if(opt == 1) {
            scanf("%d", &x);
            Add(s2[l] - '0', l, -1);
            Add(x, l, 1);
            s2[l] = '0' + x;
        }
        else
            printf("%d\n", Ask(l));
    }
    return 0;
}