#include using namespace std; using ll = long long; #define rep(i,n) for(int i=0; i//リスト #define vvi vector>//2次元配列 #define sr(a) sort(a.begin(),a.end())//小さい順に #define rev(a) reverse(a.begin(),a.end())//順序を逆に #define coudo(n,x) cout<>n>>q; string s;cin>>s; ll tipe,qi;char qs; string t; ll f,ok; rep(i,q){ cin>>tipe; if(tipe==1){ cin>>qi>>qs; s[qi-1]=qs; } else{ f=0; cin>>t; rep(l,t.size()){ ok=0; rep(j,n){ if(s[j]==t[l]){ ok=1; } } if(ok==0){ f=1; } } if(f==0){ cout<<"Yes"<