2022 4 1
def get(l,r):
return (h[r]-h[l-1]*q[r-l+1])%N
N=2**64
P=131
h=[0]*100005#前缀
q=[0]*100005#乘方
q[0]=1
n,m=map(int,input().split())
p=input()
p='0'+p
for i in range(1,n+1):
q[i]=(q[i-1]*P)%N
h[i]=(h[i-1]*P+ord(p[i]))%N
for i in range(m):
l1,r1,l2,r2=map(int,input().split())
if get(l1,r1)==get(l2,r2):
print("Yes")
else:
print("No")