#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define endl "\n"
#define rep(i, a, b) for (auto (i) = (a); (i) < (b); (i)++)
#define rrep(i, a, b) for (auto (i) = (a); (i) > (b); (i)--)

#define aim_cpo do{ios::sync_with_stdio(false);\
cin.tie(nullptr);cout.precision(12);cout<<fixed;}while(0)

#define LOCAL_INPUT do{FILE *stream1;\
stream1=freopen("/Users/aim_cpo/CLionProjects/competitive/in.txt","r",stdin);\
if(stream1==nullptr)return 0;}while(0)
#define LOCAL_OUTPUT do{FILE *stream2;\
stream2 = freopen("out.txt", "w", stdout);\
if (stream2 == nullptr) return 0;}while(0)

#ifdef LOCAL_DEFINE
#define show(x) cerr << #x << " = " << (x) << endl
#define dump(x) cerr << #x << " = " << (x) << " (line " << __LINE__ << ")" << endl
#define showV(v, n) do{\
for(int _i_t_e_=0; _i_t_e_<(n);_i_t_e_++)\
cerr<<"("<<_i_t_e_<<" = "<<(v)[_i_t_e_]<<") ";\
cerr<<endl;}while(0)
#define showA(a, n) do{\
for(int _i_t_e_=0;_i_t_e_<(n);_i_t_e_++)\
cerr<<"("<<_i_t_e_<<" = "<<(a)[_i_t_e_]<<") ";\
cerr<<endl;}while(0)
#define showA2(a, n, m) do{\
for(int _i_t_e_=0;_i_t_e_<(n);_i_t_e_++){\
for(int _i_t_e_2=0;_i_t_e_2<(m);_i_t_e_2++){\
cerr<<"("<<_i_t_e_<<", "<<_i_t_e_2<<" = "<<(a)[_i_t_e_][_i_t_e_2]<<") ";\
}cerr<<endl;}cerr<<endl;}while(0)
#else
#define show(x)
#define dump(x)
#define showV(v, n)
#define showA(a, n)
#define showA2(a, n, m)
#endif

typedef long long ll;
typedef unsigned long long ull;

constexpr const int INT_INF=0x3f3f3f3f; //1061109567
constexpr const ll LL_INF=0x3f3f3f3f3f3f3f3f; //4557430888798830399

template <typename T> bool chmin(T &a, T b){return a>b?(a=b,true):false;}
template <typename T> bool chmax(T &a, T b){return a<b?(a=b,true):false;}
template <typename T> void ln(T i, T n){cout<<(i==n-1?"\n":" ");}
template <typename T, typename S>
ostream &operator<<(ostream &out,const pair<T, S> &pair1){
  out<<'('<<pair1.fi<<", "<<pair1.se<<')';return out;}
template <typename T>
ostream &operator<<(ostream &out,const vector<T> &vector1){
  out<<'[';for(unsigned int i=0;i<vector1.size();i++){
    out<<vector1[i];if(i==vector1.size()-1)out<<"]";else out<<", ";
  }return out;
}

// INT
#define GCD(a, b) __gcd(a, b)
template <typename T> T LCM(T a, T b) {return a / GCD(a, b) * b;}
template <typename T> T EXTGCD(T a, T b, T& x, T& y) {
  T d = a;
  if (b != 0) {d=EXTGCD(b,a%b,y,x);y-=(a/b)*x;}
  else x=1,y=0;
  return d;
}
template <typename T> bool is_prime(T a) {
  for(int i=2;i*i<=a;i++)if(a%i==0)return 1;
  return 0;
}
template <typename T, typename S> T Pow(T a, S b) {
  T res = 1, now = a;
  while(b){if(b&1)res*=now;b>>=1;now*=now;}return res;
}

// MOD
ll MOD = 1000000000L + 7L;
#define add(a, b) ((a % MOD) + (b % MOD)) % MOD
#define mul(a, b) ((a % MOD) * (b % MOD)) % MOD
#define sub(a, b) ((a % MOD) + MOD - (b % MOD)) % MOD
template <typename T, typename S> T ModPow(T a, S b) {
  T res = 1, now = a;
  while(b){if(b&1)res=mul(res,now);b>>=1;now=mul(now,now);}return res;
}
template <typename T> T mod_inverse(T a, T mod, bool prime){ // if mod is prime, "prime" is true.
  if(prime)return ModPow(a, mod - 2);
  else{T x,y;EXTGCD(a,mod,x,y);return (mod+x%mod)%mod;}
}
#define divide(a, b) ((a % MOD) * (mod_inverse(b, MOD, true))) % MOD

//LLの数値をつかう時は最後にLをつける癖をつけよう
//
//  ┏┓┏┓　┓　┏┓
//  ┏┛┃┃　┃　┗┫
//  ┗┛┗┛　┻　┗┛
//
//   謹┃賀┃新┃年┃
//   ━┛━┛━┛━┛
//WWWWWWWWWWWWWWWWWWWWWW

string s, t;
int q;
char a[100001], b[100001];

inline bool func(int l1, int r1, int l2, int r2) {
  char res1, res2;
  if (l1 == 0) res1 = a[r1];
  else {
    if (a[l1 - 1] == a[r1]) res1 = '#';
    else if (a[l1 - 1] == '#') res1 = a[r1];
    else if (a[r1] == '#') res1 = (a[l1 - 1] == 'A' ? 'B' : 'A');
    else res1 = a[l1 - 1];
  }
  if (l2 == 0) res2 = b[r2];
  else {
    if (b[l2 - 1] == b[r2]) res2 = '#';
    else if (b[l2 - 1] == '#') res2 = b[r2];
    else if (b[r2] == '#') res2 = (b[l2 - 1] == 'A' ? 'B' : 'A');
    else res2 = b[l2 - 1];
  }
  return res1 == res2;
}

int main() {
  aim_cpo; // インタラクティブのときは消すように.
#ifdef LOCAL_DEFINE
  LOCAL_INPUT; // インタラクティブのときは消すように.
//  LOCAL_OUTPUT; // ファイルに出力したいときのみ
  show(MOD);
#endif
  // テキトー考察
  //
  // どんな文字列でも何回か操作すると1文字以下にすることができる.
  // AA -> B, BB -> A, AB -> '', BA -> ''
  // 区間内の文字列を圧縮した文字同士が同じならyes
  // なぜなら、B -> AA, A -> BB, (空文字列出ない限り) '' -> AB, '' -> BA も成り立つから、
  // 圧縮した文字列さえあっていれば、残りの文字列は好きに一致させることができる.
  // ということで、[0, r]までの区間内の圧縮した文字を事前に求めておいて、
  // [l, r] の文字は [0, l - 1], [0, r]を用いて求められるので高速にクエリに応答できる.
  cin >> s >> t;
  a[0] = s[0];
  rep(i, 1, (int)s.size()) {
    if (a[i - 1] == '#') a[i] = s[i];
    else if (a[i - 1] == s[i] && s[i] == 'A') a[i] = 'B';
    else if (a[i - 1] == s[i] && s[i] == 'B') a[i] = 'A';
    else a[i] = '#';
  }
  b[0] = t[0];
  rep(i, 1, (int)t.size()) {
    if (b[i - 1] == '#') b[i] = t[i];
    else if (b[i - 1] == t[i] && t[i] == 'A') b[i] = 'B';
    else if (b[i - 1] == t[i] && t[i] == 'B') b[i] = 'A';
    else b[i] = '#';
  }
  cin >> q;
  rep(i, 0, q) {
    int l1, r1, l2, r2; cin >> l1 >> r1 >> l2 >> r2;
    l1--; l2--; r1--; r2--;
    if (func(l1, r1, l2, r2)) cout << "YES" << endl;
    else cout << "NO" << endl;
  }
#ifdef  LOCAL_DEFINE
  cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s." << endl;
#endif
  return 0;
}

Measured memory_bytes: 1104