include[HTML_REMOVED]
include[HTML_REMOVED]
typedef unsigned long long ULL;
using namespace std;
ULL q[1000010],p[1000010];
ULL find(int l,int r){
return q[r]-q[l-1]*p[r-l+1];
}
int main()
{
int m;
string s;
cin>>s;
cin>>m;
q[0]=0;
p[0]=1;
for(int i=0;i[HTML_REMOVED]>l1>>r1>>l2>>r2;
if(find(l1,r1)==find(l2,r2))cout<<”Yes”<<endl;
else cout<<”No”<<endl;
}
}