#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}
 
#define mod 1000000007
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

char s[maxn],S[maxn];
int n,a[maxn],c[13];

int lim;

struct bit{
	int fir[maxn];
	int t[maxn<<2];
	inline void up(int p){
		t[p]=t[p<<1]+t[p<<1|1];
	}
	void build(int p,int l,int r){
		if(l==r)return t[p]=fir[l],void();
		int mid=l+r>>1;
		build(p<<1,l,mid),build(p<<1|1,mid+1,r),up(p);
	}
	void mdf(int p,int l,int r,int x){
		if(l==r)return t[p]=fir[l],void();
		int mid=l+r>>1;
		x<=mid?mdf(p<<1,l,mid,x):mdf(p<<1|1,mid+1,r,x);up(p);
	}
	void add(int x,int y){
		fir[x]+=y;
		mdf(1,1,n,x);
	}
	int ask(int p,int l,int r,int ql,int qr){
		if(l>=ql&&r<=qr)return t[p];
		int mid=l+r>>1,res=0;
		if(ql<=mid)res+=ask(p<<1,l,mid,ql,qr);
		if(qr>mid)res+=ask(p<<1|1,mid+1,r,ql,qr);
		return res;
	}
	int bound(int p,int l,int r,int ql){
	//	cout<<"bound "<<l<<" "<<r<<" "<<ql<<' '<<t[p]<<"\n";
		if(t[p]==r-l+1)return n+1;
		if(l==r)return t[p]?n+1:l;
		int mid=l+r>>1;
		if(ql<=mid){
			int res=bound(p<<1,l,mid,ql);
			if(res==n+1)return bound(p<<1|1,mid+1,r,ql); 
			else return res;
		}
		return bound(p<<1|1,mid+1,r,ql);
	}
}t[10];

int prelen=-inf;

int cy[13],cpre[13],diff,ptx;
bool check(int L){
	For(i,0,9){
		if(L)cy[i]=t[i].ask(1,1,n,1,L);
		else cy[i]=0;
		if(cy[i]>c[i])return 0;
		cpre[i]=cy[i];
		cy[i]=c[i]-cy[i];
	}
	if(L==n)return 1;
	int pos=L+1;
	Rep(i,9,0){
		if(!cy[i])continue;
		// [pos,pos+cy[i]-1] 
		lim=pos+cy[i]-1;
	//	cout<<"l,r "<<i<<' '<<pos<<" "<<lim<<"\n";
		int nxt=t[i].bound(1,1,n,pos);
	//	cout<<"nxt "<<nxt<<"\n";
		if(nxt>lim){
			pos+=cy[i];
			continue;
		}
		diff=nxt;
		if(a[nxt]>i)return 0;
		assert(a[nxt]<i);
		cy[i]-=(nxt-pos);
		For(j,a[nxt]+1,9)
			if(cy[j]){
				ptx=j;
				--cy[j];
				break;
			}
		return 1;
	}
	diff=n+1;
	return 1;
}

void work()
{
	if(!check(0)){
		prelen=-1;
		return;
	}
	int l=diff,r=n,res=diff-1;
	while(l<=r){
		int mid=l+r>>1;
		if(check(mid)) res=diff-1,l=res+1;
		else r=mid-1;
	}
	prelen=res;
	check(prelen);
}

int query(int x){
	if(prelen==-1) return -1;
	if(x<=prelen) return a[x];
	if(x==prelen+1) return ptx;
	x-=prelen+1;
	For(i,0,9)
		if(cy[i]){
			if(cy[i]>=x)return i;
			x-=cy[i];
		}
	assert(0);
} 

signed main()
{
	scanf("%s%s",s,S);
	n=strlen(s);
	For(i,0,n-1){
		c[s[i]-'0']++;
		a[i+1]=(S[i]-'0');
	}
	For(i,1,n) t[a[i]].fir[i]=1;
	For(i,0,9) t[i].build(1,1,n);
	int Q=read();
	For(_,1,Q){
		int op=read(),x,y;
		if(op==1){
			x=read(),y=read();
			prelen=-inf;
			t[a[x]].add(x,-1);
			t[a[x]=y].add(x,1);
		}else{
			if(prelen==-inf)work();
			x=read();
			printf("%d\n",query(x));
		}
	}
	return 0;
}

/*
3304 1615
6
2 3
2 4
1 1 3
2 2
1 2 4
2 1

838046 780357
10
2 1
2 2
1 2 4
2 3
2 4
1 4 5
2 5
2 6
1 1 9
2 2

2950 9052
4
2 1
2 2
2 3
2 4
*/