#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx;
#define For(i,x,y,...) for(int i=x,##__VA_ARGS__;i<=(y);++i)
#define rFor(i,x,y,...) for(int i=x,##__VA_ARGS__;i>=(y);--i)
#define Rep(i,x,y,...) for(int i=x,##__VA_ARGS__;i<(y);++i)
#define pb emplace_back
#define sz(a) int((a).size())
#define all(a) begin(a),end(a)
#define fi first
#define se second
typedef long long LL; typedef vector<int> Vi; typedef pair<int,int> Pii;
auto ckmax=[](auto &x,auto y) { return x<y ? x=y,true : false; };
auto ckmin=[](auto &x,auto y) { return y<x ? x=y,true : false; };
sfmt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r) { return uniform_int_distribution<>(l,r)(mt); }
template<typename T=int>T read() { T x; cin>>x; return x; }

const int mod = 1e9+97;
struct mint {
	int x; mint(int x=0):x(x<0?x+mod:x<mod?x:x-mod){}
	mint(LL y) { y%=mod, x=y<0?y+mod:y; }
	mint& operator += (const mint &y) { x=x+y.x<mod?x+y.x:x+y.x-mod; return *this; }
	mint& operator -= (const mint &y) { x=x<y.x?x-y.x+mod:x-y.x; return *this; }
	mint& operator *= (const mint &y) { x=1ll*x*y.x%mod; return *this; }
	friend mint operator + (mint x,const mint &y) { return x+=y; }
	friend mint operator - (mint x,const mint &y) { return x-=y; }
	friend mint operator * (mint x,const mint &y) { return x*=y; }
};	mint Pow(mint x,LL y=mod-2) { mint z(1);for(;y;y>>=1,x*=x)if(y&1)z*=x;return z; }

const int N = 5e5+5;
int n,m;

struct Mat {
	mint a[3][3];
	Mat(bool op=0) { memset(a,0,sizeof a);if(op)a[0][0]=a[1][1]=a[2][2]=1; }
	mint* operator [] (int i) { return a[i]; }
	const mint* operator [] (int i) const { return a[i]; }
	bool operator == (const Mat &b) {
		For(i,0,2) For(j,0,2) if( a[i][j].x != b[i][j].x ) return 0;
		return 1;
	}
	friend Mat operator * (const Mat &a,const Mat &b) {
		Mat c;
		For(i,0,2) For(k,0,2) For(j,0,2) c[i][j] += a[i][k] * b[k][j];
		return c;
	}
} I(1),val[3][2];

void gen(Mat *a) {
	loop:;
	static Mat b; For(i,0,2) For(j,0,2) b[i][j] = rnd(0,mod-1);
	a[0] = b, a[1] = I;
	For(i,0,2) {
		int p = -1; For(j,i,2) if( a[0][j][i].x ) { p = j; break; }
		if( !~p ) goto loop;
		swap(a[0].a[i],a[0].a[p]), swap(a[1].a[i],a[1].a[p]);
		mint inv = Pow(a[0][i][i]);
		rFor(j,2,0) a[1][i][j] *= inv;
		rFor(j,2,i) a[0][i][j] *= inv;
		For(j,0,2) if( j != i ) {
			rFor(k,2,0) a[1][j][k] -= a[0][j][i] * a[1][i][k];
			rFor(k,2,i) a[0][j][k] -= a[0][j][i] * a[0][i][k];
		}
	}
	a[0] = b;
	assert(a[0]*a[1]==I);
}

#define ls (u<<1)
#define rs (u<<1|1)
#define mid (l+r>>1)
struct { int add; Mat x[3]; } t[N*4];
void up(int u) { For(i,0,2) t[u].x[i] = t[ls].x[i] * t[rs].x[i]; }
void down(int u,int x) { rotate(t[u].x,t[u].x+x%3,t[u].x+3), t[u].add += x; }
void down(int u)
	{ if( t[u].add ) down(ls,t[u].add), down(rs,t[u].add), t[u].add = 0; }
void bld(int u=1,int l=1,int r=n) {
	if( l == r ) {
		int x = read<char>()-'0';
		For(i,0,2) t[u].x[i] = val[(x+i)%3][l&1];
		return;
	}
	bld(ls,l,mid), bld(rs,mid+1,r), up(u);
}
void mdf(int ql,int qr,int u=1,int l=1,int r=n) {
	if( qr < l || r < ql ) return;
	if( ql <= l && r <= qr ) return down(u,1);
	down(u), mdf(ql,qr,ls,l,mid), mdf(ql,qr,rs,mid+1,r), up(u);
}
Mat qry(int ql,int qr,int u=1,int l=1,int r=n) {
	if( ql <= l && r <= qr ) return t[u].x[0];
	down(u);
	return qr<=mid ? qry(ql,qr,ls,l,mid) : mid<ql ? qry(ql,qr,rs,mid+1,r) :
		qry(ql,qr,ls,l,mid)*qry(ql,qr,rs,mid+1,r);
}

signed main() {
#ifdef FT
	freopen("in","r",stdin); freopen("out","w",stdout);
#endif
	ios::sync_with_stdio(0);cin.tie(0);
	gen(val[0]), gen(val[1]), gen(val[2]);
	cin>>n>>m, bld();
	while( m-- ) {
		int op,l,r; cin>>op>>l>>r;
		if( op == 1 ) mdf(l,r);
		else cout<<(qry(l,r)==I?"Yes\n":"No\n");
	}
	return 0;
}