#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
const int N = 1e6 + 10;
typedef long long ll;
char s[N], t[N];
int q, l, r;
namespace SAMs {
    struct SAM {
        int link, ch[26], len;
    } t[N];
    int tot, np, n;
    namespace SGT {
        struct Segment {
            int l, r, sum;
        } t[N << 6];
        int tt, rt[N];
        inline void pushup(int p) {
            t[p].sum = t[t[p].l].sum + t[t[p].r].sum;
        }
        void modify(int &p, int l, int r, int pos) {
            if (!p) p = ++tt;
            if (l == r) { ++t[p].sum; return; }
            int mid = (l + r) >> 1;
            if (pos <= mid) modify(t[p].l, l, mid, pos);
            else modify(t[p].r, mid + 1, r, pos);
            pushup(p);
        }
        int merge(int p, int q, int l, int r) {
            if (!p || !q) return p + q;
            if (l == r) {
                int tp = ++tt;
                t[tp].sum = t[p].sum + t[q].sum;
                return tp;
            }
            int mid = (l + r) >> 1, tp = ++tt;
            t[tp].l = merge(t[p].l, t[q].l, l, mid);
            t[tp].r = merge(t[p].r, t[q].r, mid + 1, r);
            pushup(tp);
            return tp;
        }
        int query(int p, int l, int r, int ql, int qr) {
            if (!p) return 0;
            if (ql <= l && r <= qr) return t[p].sum;
            int mid = (l + r) >> 1, res = 0;
            if (ql <= mid) res += query(t[p].l, l, mid, ql, qr);
            if (mid < qr) res += query(t[p].r, mid + 1, r, ql, qr);
            return res;
        }
    }
    inline void insert(char c) {
        int now = ++tot;
        t[now].len = t[np].len + 1;
        while (~np && !t[np].ch[c - 'a']) {
            t[np].ch[c - 'a'] = now;
            np = t[np].link;
        }
        if (~np) {
            int q = t[np].ch[c - 'a'];
            if (t[np].len + 1 == t[q].len) {
                t[now].link = q;
            } else {
                int clone = ++tot;
                t[clone].len = t[np].len + 1;
                t[clone].link = t[q].link;
                rep(i, 0, 25) t[clone].ch[i] = t[q].ch[i];
                while (~np && t[np].ch[c - 'a'] == q) {
                    t[np].ch[c - 'a'] = clone;
                    np = t[np].link;
                }
                t[q].link = clone;
                t[now].link = clone;
            }
        }
        np = now;
        SGT::modify(SGT::rt[np], 1, n, t[np].len);
        // printf("De:%d %d %d\n", np, t[np].link, t[np].len);
    }
    vector<int> e[N];
    void dfs(int u) {
        // printf("de:%d\n", u);
        for (auto &v: e[u]) {
            dfs(v);
            SGT::rt[u] = SGT::merge(SGT::rt[u], SGT::rt[v], 1, n);
        }
        // if (u == 0) printf("De:%d\n", SGT::query(SGT::rt[1], 1, n, 2, 7));
        // printf("ed:%d\n", u);
    }
    inline void build(char *s) {
        t[0].link = -1;
        n = strlen(s + 1);
        rep(i, 1, n) insert(s[i]);
        rep(i, 1, tot) e[t[i].link].emplace_back(i);
        dfs(0);
        // printf("qwq: %d\n", SGT::query(SGT::rt[4], 1, n, 2, 7));
    }
}
namespace SAMt {
    struct SAM {
        int link, ch[26], len;
    } t[N];
    int tot, np, n, pos[N];
    inline void insert(char c) {
        int now = ++tot;
        t[now].len = t[np].len + 1;
        while (~np && !t[np].ch[c - 'a']) {
            t[np].ch[c - 'a'] = now;
            np = t[np].link;
        }
        if (~np) {
            int q = t[np].ch[c - 'a'];
            if (t[np].len + 1 == t[q].len) {
                t[now].link = q;
            } else {
                int clone = ++tot;
                t[clone].len = t[np].len + 1;
                t[clone].link = t[q].link;
                rep(i, 0, 25) t[clone].ch[i] = t[q].ch[i];
                while (~np && t[np].ch[c - 'a'] == q) {
                    t[np].ch[c - 'a'] = clone;
                    np = t[np].link;
                }
                t[q].link = clone;
                t[now].link = clone;
            }
        }
        np = now;
        pos[t[np].len] = np;
    }
    ll ans = 0;
    int inlen[N], mxd[N];
    vector<int> e[N];
    void dfs(int u, int fa) {
        for (auto &v: e[u]) dfs(v, u), mxd[u] = max(mxd[u], mxd[v]);
        if (~fa) {
            ans += t[u].len - t[fa].len;
            if (mxd[u] >= t[u].len) ans -= t[u].len - t[fa].len;
            else if (mxd[u] > t[fa].len) ans -= mxd[u] - t[fa].len;
        }
    }
    inline void calc(char *s, int l, int r) {
        n = strlen(s + 1);
        rep(i, 0, tot) {
            t[i].len = t[i].link = 0;
            rep(j, 0, 25) t[i].ch[j] = 0;
            mxd[i] = 0;
            e[i].clear();
        }
        t[0].link = -1;
        tot = np = 0;
        rep(i, 1, n) insert(s[i]);
        int p = 0, nlen = 0;
        rep(i, 1, n) {
            // try to jump s[i]
            while (~p && !SAMs::t[p].ch[s[i] - 'a']) {
                p = SAMs::t[p].link;
                if (~p) nlen = SAMs::t[p].len;
            }
            if (~p) {
                p = SAMs::t[p].ch[s[i] - 'a']; ++nlen;
                // printf("dee:%d %d %d %d %d %d\n", i, nlen, p, SAMs::SGT::query(SAMs::SGT::rt[p], 1, SAMs::n, l + nlen - 1, r), l, r);
                while (p && (l + nlen - 1 > r || !SAMs::SGT::query(SAMs::SGT::rt[p], 1, SAMs::n, l + nlen - 1, r))) {
                    while (nlen > SAMs::t[SAMs::t[p].link].len && (l + nlen - 1 > r || !SAMs::SGT::query(SAMs::SGT::rt[p], 1, SAMs::n, l + nlen - 1, r))) {
                        --nlen;
                    }
                    if (nlen > SAMs::t[SAMs::t[p].link].len) break;
                    p = SAMs::t[p].link; nlen = SAMs::t[p].len;
                }
            } else ++p, nlen = 0;
            inlen[i] = nlen;
            mxd[pos[i]] = inlen[i];
            // printf("de:%d %d\n", i, inlen[i]);
        }
        rep(i, 1, tot) e[t[i].link].emplace_back(i);
        ans = 0;
        dfs(0, -1);
        printf("%lld\n", ans);
    }
}
int main() {
    scanf("%s%d", s + 1, &q);
    SAMs::build(s);
    rep(i, 1, q) {
        scanf("%s%d%d", t + 1, &l, &r);
        SAMt::calc(t, l, r);
    }
    return 0;
}