#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define ten(n) ((int)1e##n)
#define fst first
#define snd second
using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class T> bool amax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool amin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}
template<class T>T read(){T t;cin>>t;return t;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<<'('<<p.fst<<", "<<p.snd<<')';}
ostream&operator<<(ostream&o,const vb&t){forr(e,t)o<<"#."[e];return o;}
template<class T>ostream&operator<<(ostream&o,const vector<T>&t){o<<"{";forr(e,t)o<<e<<",";o<<"}"<<endl;return o;}
#ifdef LOCAL
vs s_p_l_i_t(const string&s,char c){vs v;stringstream ss(s);string x;while(getline(ss,x,c))v.emplace_back(x);return (v);}
void e_r_r(vs::iterator it){cerr<<endl;}
template<class T,class... Args>void e_r_r(vs::iterator it,T a,Args... args){cerr<<it->substr((*it)[0]==' ',it->length())<<" = "<<a<<", ";e_r_r(++it,args...);}
#define out(args...){vs a_r_g_s=s_p_l_i_t(#args,',');e_r_r(a_r_g_s.begin(),args);}
#else
#define out(args...)
#endif

char hoge(int a, int b) {
  int mi = min(a, b);
  a -= mi;
  b -= mi;

  a %= 3;
  b %= 3;
  if (a == 1) return 'A';
  if (a == 2) return 'B';
  if (b == 1) return 'B';
  if (b == 2) return 'A';

  return '-';
}

void Main() {
  string s = rs();
  string t = rs();
  int q = ri();

  int n = sz(s);
  int m = sz(t);

  vi sa(n+1), sb(n+1);
  vi ta(m+1), tb(m+1);

  rep(i, n) {
    if (s[i] == 'A') sa[i+1]++;
    else sb[i+1]++;
  }

  rep(i, m) {
    if (t[i] == 'A') ta[i+1]++;
    else tb[i+1]++;
  }

  rep(i, n) sa[i+1] += sa[i];
  rep(i, n) sb[i+1] += sb[i];
  rep(i, m) ta[i+1] += ta[i];
  rep(i, m) tb[i+1] += tb[i];

  out(sa, sb, ta, tb);

  rep(_, q) {
    int a = ri()-1;
    int b = ri()-1;
    int c = ri()-1;
    int d = ri()-1;

    int fa = sa[b+1] - sa[a-1+1];
    int fb = sb[b+1] - sb[a-1+1];

    int da = ta[d+1] - ta[c-1+1];
    int db = tb[d+1] - tb[c-1+1];

    char t1 = hoge(fa, fb);
    char t2 = hoge(da, db);
    //out(fa, fb, t1);
    //out(da, db, t2);
    cout << (t1 == t2 ? "YES" : "NO") << endl;
  }
}
int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }


Measured memory_bytes: 2512