取 $P=131$ 或者 $P = 13331$

• 在字符串 $S$ 后面加一个字符 $c$
  $H(S+c) = (H(S) \cdot P + val[c]) \bmod M$
• 字符串 $S$ 的 $\textbf{Hash}$ 值为 $H(S)$
  字符串 $S + T$ 的 $\textbf{Hash}$ 值为 $H(S+T)$
  可以推出字符串 $T$ 的 $\textbf{Hash}$ 值为
  （相当于将字符串 $S$ 在 $P$ 进制下左移 $len(T)$ 位）
  $H(T) = (H(S+T) - H(S) \cdot P^{len(T)}) \bmod M$
• 字符串 $\textbf{Hash}$ 中的前缀哈希
• 对于前缀子串 $S[1\cdots i]$
  $H(i) = H(i-1) \cdot P + (S[i])$
• 对于任意区间 $[l, r]$
  $H(\ [l\cdots r] \ ) = H(r) - H(l-1) * P^{r-l+1}$

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <assert.h>
#include <unordered_map>

using namespace std;
typedef long long ll;

#define Cmp(a, b) memcmp(a, b, sizeof(b))
#define Cpy(a, b) memcpy(a, b, sizeof(b))
#define Set(a, v) memset(a, v, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define _forS(i, l, r) for(set<int>::iterator i = (l); i != (r); i++)
#define _rep(i, l, r) for(int i = (l); i <= (r); i++)
#define _for(i, l, r) for(int i = (l); i < (r); i++)
#define _forDown(i, l, r) for(int i = (l); i >= r; i--)
#define debug_(ch, i) printf(#ch"[%d]: %d\n", i, ch[i])
#define debug_m(mp, p) printf(#mp"[%d]: %d\n", p->first, p->second)
#define debugS(str) cout << "dbg: " << str << endl;
#define debugArr(arr, x, y) _for(i, 0, x) { _for(j, 0, y) printf("%c", arr[i][j]); printf("\n"); }
#define _forPlus(i, l, d, r) for(int i = (l); i + d < (r); i++)
#define lowbit(i) (i & (-i))
#define MPR(a, b) make_pair(a, b)

pair<int, int> crack(int n) {
    int st = sqrt(n);
    int fac = n / st;
    while (n % st) {
        st += 1;
        fac = n / st;
    }

    return make_pair(st, fac);
}

inline ll qpow(ll a, int n) {
    ll ans = 1;
    for(; n; n >>= 1) {
        if(n & 1) ans *= 1ll * a;
        a *= a;
    }
    return ans;
}

template <class T>
inline bool chmax(T& a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll ksc(ll a, ll b, ll mod) {
    ll ans = 0;
    for(; b; b >>= 1) {
        if (b & 1) ans = (ans + a) % mod;
        a = (a * 2) % mod;
    }
    return ans;
}

ll ksm(ll a, ll b, ll mod) {
    ll ans = 1 % mod;
    a %= mod;

    for(; b; b >>= 1) {
        if (b & 1) ans = ksc(ans, a, mod);
        a = ksc(a, a, mod);
    }

    return ans;
}

template <class T>
inline bool chmin(T& a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool lexSmaller(vector<T> a, vector<T> b) {
    int n = a.size(), m = b.size();
    int i;
    for(i = 0; i < n && i < m; i++) {
        if (a[i] < b[i]) return true;
        else if (b[i] < a[i]) return false;
    }
    return (i == n && i < m);
}

// ============================================================== //

typedef unsigned long long ull;
const int maxn = 1000010, P = 131;

char str[maxn];
ull H[maxn], pwr[maxn];
int n, m;

ull get(int l, int r) {
    return H[r] - H[l-1] * pwr[r-l+1];
}

int main() {
    freopen("input.txt", "r", stdin);
    scanf("%s", str + 1);
    n = strlen(str + 1);

    pwr[0] = 1;
    for (int i = 1; i <= n; i++) {
        H[i] = H[i-1] * P + str[i] - 'a' + 1;
        pwr[i] = pwr[i-1] * P;
    }

    int m;
    scanf("%d", &m);
    while (m--) {
        int l1, r1, l2, r2;
        scanf("%d%d%d%d", &l1, &r1, &l2, &r2);
        if (get(l1, r1) == get(l2, r2)) puts("Yes");
        else puts("No");
    }
}