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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int> > mati;
typedef vector<vector<double> > matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef vector<pll> vpll;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back

inline void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

inline void OUT(void){
  cout << "\n";
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cout << VEC[i] << " ";
  }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i, MAT.size()){
    REP(j, MAT[i].size()){
      cout << MAT[i][j] << " ";
    }
    cout << "\n";
  }
};

template <typename CLASS1, typename CLASS2>
class HOGE{
  public:
    CLASS1 key;
    CLASS2 value;
    HOGE(void){
      return;
    };
    HOGE(CLASS1 key, CLASS2 value){
      this->key = key;
      this->value = value;
    };
    ~HOGE(void){
      return;
    };

    void print(void){
      cout << "key : " << key << ", value : " << value << "\n";
      return;
    };
    
    bool operator==(const HOGE &obj){
      return (this->value == obj.value);
    };
    bool operator<(const HOGE &obj){
      return (this->value < obj.value);
    };
    bool operator>(const HOGE &obj){
      return (this->value > obj.value);
    };
};

template <typename CLASS1, typename CLASS2>
bool operator==(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value == hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator<(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value < hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator>(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value > hoge2.value;
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

template <typename CLASS1>
class Binary_Index_Tree{
  private:
    CLASS1 n;
    // [1, n]
    vector<CLASS1> bit;

  public:
    Binary_Index_Tree(CLASS1 n_){
      bit.resize(n_+1, 0);
      //n = n_+1;
      n = n_; //?
      return;
    };

    ~Binary_Index_Tree(void){
      return;
    };

    CLASS1 sum(CLASS1 i){
      if(i == -1) return 0;
      if(i < -2 || n <= i){
        fprintf(stderr, "Binary_Index_Tree Sum Position Error\n");
        exit(0);
      }
      CLASS1 s=0;
      i += 1;
      while(i>0){
        s += bit[i];
        i -= i&(-i);
      }
      return s;
    };

    void update(CLASS1 i, CLASS1 x){
      if(i < 0 || n <= i){
        fprintf(stderr, "Binary_Index_Tree Update Position Error\n");
        exit(0);
      }
      CLASS1 pre = sum(i) - sum(i-1);
      i += 1;
      while(i <= n){
        bit[i] += (x-pre);
        i += i&(-i);
      }
      return;
    };
    
};

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  string S, T;
  IN(S,T);
  Binary_Index_Tree<ll> que1(S.size());
  Binary_Index_Tree<ll> que2(T.size());

  REP(i, S.size()){
    if(S[i]=='A')
      que1.update(i, 1);
    else
      que1.update(i, 2);
  }

  REP(i, T.size()){
    if(T[i]=='A')
      que2.update(i, 1);
    else
      que2.update(i, 2);
  }

  ll q;
  IN(q);
  REP(i, q){
    ll a,b,c,d;
    IN(a,b,c,d);

    if((que1.sum(b-1)-que1.sum(a-2))%3==(que2.sum(d-1)-que2.sum(c-2))%3){
      cout << "YES\n";
    }else{
      cout << "NO\n";
    }
  }

  return 0;
}

Measured memory_bytes: 2512