I,R=input,range
def J():
	return map(int,I().split())
def O(b,a):
	return [a,~a][b[2]]&b[0]|b[1]
def C(f,b):
	return [~b[1]&f[0],~b[0]&~b[1]&f[0]|f[1],1-b[2]]if f[2]else[b[0]&f[0],b[1]&f[0]|f[1],b[2]]
N,Q=J()
P=[sum(((d>>i)&1)<<d for d in R(64))for i in R(6)]
M=1000
A=[P[i%6]for i in R(N)]
B=[[-1,0,0]for j in R(M)]
E="land"
for q in R(Q):
	h,o,l,r,x,y=I().split()
	h,l,r,x,y=map(int,[h,l,r,x,y])
	a,r=O(B[h//M],A[h]),r+1
	f=[[-1,a][o==E],[a,0][o==E],o<E]
	m=(l+M-1)//M
	n=max(m,r//M)
	u=min(m*M,r)
	if m:
		for i in R(m*M-M,min(m*M,N)):A[i]=O(B[m-1],A[i])
		B[m-1]=[-1,0,0]
	for i in R(l,u):A[i]=O(f,A[i])
	for j in R(m,n):B[j]=C(f,B[j])
	for i in R(n*M,min(n*M+M,N)):A[i]=O(B[n],A[i])
	if n*M<N:B[n]=[-1,0,0]
	for i in R(max(u,n*M),r):A[i]=O(f,A[i])
	X=set()
	s="Yes"
	for i in R(x,y+1):
		a=O(B[i//M],A[i])
		if a in X:break
		X.add(a)
	else:s="No"
	print(s)