// clang-format off
/*
Time: 
lable []
Wrong Answer:
    1. 
*/
#include<bits/stdc++.h>
#include<bits/extc++.h>
#define fup(i, bg, ed) for(int i = (bg); i <= (ed); ++i)
#define fdn(i, bg, ed) for(int i = (bg); i >= (ed); --i)
#define mms(f, x) memset(f, x, sizeof f)
#ifdef cDebug
FILE* dbg_stream = fopen("dbg.log", "w");
#define pdbg(...) fprintf(dbg_stream, __VA_ARGS__), fflush(dbg_stream)
#else 
#define pdbg(...) 1
#endif

typedef long long lld;
const int N = 1e6 + 10;
using namespace std;
int dfn[N*3], out[N*3], pdfn;

namespace Sgt {
    int mx[N<<2];
    void upd(int u, int l, int r, int x, int v) {
        if(l == r) return mx[u] = v, void();
        int mid = (l + r) >> 1;
        if(x <= mid) upd(u<<1, l, mid, x, v);
        else upd(u<<1|1, mid+1, r, x, v);
        mx[u] = max(mx[u<<1], mx[u<<1|1]);
    }
    int qry(int u, int l, int r, int L, int R) {
        if(L <= l && r <= R) return mx[u];
        int mid = (l + r) >> 1;
        if(R <= mid) return qry(u<<1, l, mid, L, R);
        if(L > mid) return qry(u<<1|1, mid+1, r, L, R);
        return max(
            qry(u<<1, l, mid, L, R),
            qry(u<<1|1, mid+1, r, L, R)
        );
    }
}

struct SAM {
    struct Node {
        int chl[26], fail, len, mnr;
        Node() { mms(chl, 0); fail = len = 0; }
    };
    Node* t;
    int* ed;
    int tot = 1, tail = 1;

    void ext(int c, int id) {
        int cur = ++tot, p = tail; tail = cur;
        ed[id] = cur;
        t[cur].mnr = t[cur].len = t[p].len + 1;
        for(; p && !t[p].chl[c]; p = t[p].fail) t[p].chl[c] = cur;
        if(!p) t[cur].fail = 1;
        else {
            int q = t[p].chl[c];
            if(t[q].len == t[p].len + 1) t[cur].fail = q;
            else {
                int nq = ++tot;
                t[nq].len = t[p].len + 1;
                t[nq].mnr = t[q].mnr;
                memcpy(t[nq].chl, t[q].chl, sizeof t[nq].chl);
                for(; p && t[p].chl[c] == q; p = t[p].fail) t[p].chl[c] = nq;
                t[nq].fail = t[q].fail;
                t[q].fail = nq;
                t[cur].fail = nq;
            }
        }
    }

    void run(int& u, int& l, int c, int L) {
        if(t[u].chl[c]) {
            int v = t[u].chl[c];
            pdbg("qry: %d, %d => %d\n", dfn[v], out[v], Sgt::qry(1, 1, pdfn, dfn[v], out[v]));
            if(Sgt::qry(1, 1, pdfn, dfn[v], out[v]) >= L) {
                u = v;
                ++l;
                return ;
            }
        }
        l = 0;
        while(u) {
            if(t[u].chl[c] && Sgt::qry(1, 1, pdfn, dfn[t[u].chl[c]], out[t[u].chl[c]]) >= L) {
                l = t[u].len + 1;
                u = t[u].chl[c];
                return ;
            }
            u = t[u].fail;
        }
        u = 1;
        l = 0;
    }

    void dbg() {
        pdbg("chl: \n");
        fup(i, 1, tot) fup(c, 0, 25) if(t[i].chl[c]) {
            pdbg("%d %d %c\n", i, t[i].chl[c], c + 'a');
        }
        pdbg("fail: \n");
        fup(i, 2, tot) {
            pdbg("%d %d\n", i, t[i].fail);
        }
    }

    SAM(int n) {
        t = new Node[n*3 + 10];
        ed = new int[n + 10];
    }
    ~SAM() {
        delete[] t;
        delete[] ed;
    }
};

char s[N];
int n, q, ans[N];
vector<pair<int, int>> qry[N]; // l, id
string t[N];
int f[N], pf;

vector<int> e[N*3];
void dfs(int u) {
    dfn[u] = ++pdfn;
    for(int v : e[u]) {
        dfs(v);
    }
    out[u] = pdfn;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    
    cin >> s;
    n = strlen(s);
    memmove(s+1, s, n);
    cin >> q;
    SAM sams(n);
    fup(i, 1, n) sams.ext(s[i]-'a', i);
    sams.dbg();
    fup(i, 2, sams.tot) e[sams.t[i].fail].emplace_back(i);
    dfs(1);

    for(int i = 1, l, r; i <= q; i++) {
        cin >> t[i] >> l >> r;
        qry[r].emplace_back(l, i);
    }

    fup(i, 1, n) {
        Sgt::upd(1, 1, pdfn, dfn[sams.ed[i]], i);
        pdbg("ins: %d, %d\n", dfn[sams.ed[i]], i);
        for(auto[L, id] : qry[i]) {
            pf = 0;
            const int len = t[id].size();
            SAM samt(t[id].size());
            int u = 1, l = 0;
            for(char c : t[id]) {
                sams.run(u, l, c-'a', L);
                samt.ext(c-'a', 0);
                f[++pf] = l;
                pdbg("u: %d, len: %d, chr: %c, q: [%d, %d]\n", u, l, c, L, i);
            }
            // pdbg("f: "); 
            fup(j, 1, len) pdbg("%d%c\n", f[j], " \n"[j==len]);
            fup(j, 2, samt.tot) {
                ans[id] += max(0, samt.t[j].len - max(samt.t[samt.t[j].fail].len, f[samt.t[j].mnr]));
            }
        }
    }

    fup(i, 1, q) cout << ans[i] << "\n";

    #ifdef Local
    cerr << clock() * 1000. / CLOCKS_PER_SEC << "ms" << endl;
    #endif
}