#include <iostream>
#include <cstring>
using namespace std;
typedef unsigned long long ULL;
const int N =1e5+10,P=131;//p=13331 p%q ,q=2^64一般不会产生冲突
char str[N];
ULL h[N], p[N];
ULL get(int l, int r)
{
return h[r] - h[l - 1] * p[r - l + 1];
}
int main()
{
int m, n;//
cin >> n >> m;
cin >> str + 1;
p[0] = 1;
for(int i=1;i<=n;i++)
{
h[i] = h[i - 1] * P + str[i];//强转成数字 组成前缀和
p[i] = p[i - 1] * P;
}
while (m--)
{
int l1, r1, l2, r2;
cin >> l1 >> r1 >> l2 >> r2;
if (get(l1, r1) == get(l2, r2))
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
return 0;
}