#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#define ls tr[p].l
#define rs tr[p].r
using namespace std;

typedef long long LL;

const int N = 1e6 + 5;

int n, q, pos[N], rt[N << 1], l, r, mx[N << 1];

char s[N];

struct S {
    int last, idx;

    struct SAM {
        int ch[26], len, link;
    } t[N << 1];

    void inline clear() {
        for (int i = 1; i <= idx; i++) {
            for (int j = 0; j < 26; j++)
                t[i].ch[j] = 0;

            mx[i] = t[i].len = t[i].link = 0;
        }

        last = idx = 1;
    }

    void inline insert(int c, int i = 0) {
        int x = ++idx, p = last;
        t[x].len = t[last].len + 1;

        if (i)
            pos[i] = x;

        while (p && !t[p].ch[c])
            t[p].ch[c] = x, p = t[p].link;

        if (!p)
            t[x].link = 1;
        else {
            int q = t[p].ch[c];

            if (t[p].len + 1 == t[q].len)
                t[x].link = q;
            else {
                int y = ++idx;
                t[y] = t[q], t[y].len = t[p].len + 1;

                while (p && t[p].ch[c] == q)
                    t[p].ch[c] = y, p = t[p].link;

                t[q].link = t[x].link = y;
            }
        }

        last = x;
    }
} t1, t2;

struct T {
    int l, r, v;
} tr[N * 40];

int cnt;

void inline change(int &p, int l, int r, int x) {
    p = ++cnt;
    tr[p].v++;

    if (l == r)
        return;

    int mid = (l + r) >> 1;

    if (x <= mid)
        change(ls, l, mid, x);
    else
        change(rs, mid + 1, r, x);
}

void inline merge(int &p, int x, int y, int l, int r) {
    if (!x || !y) {
        p = x | y;
        return;
    }

    p = ++cnt, tr[p].v = tr[x].v + tr[y].v;
    int mid = (l + r) >> 1;
    merge(ls, tr[x].l, tr[y].l, l, mid);
    merge(rs, tr[x].r, tr[y].r, mid + 1, r);
}

int inline query(int p, int l, int r, int x, int y) {
    if (x > y)
        return 0;

    if (!p)
        return 0;

    if (x <= l && r <= y)
        return tr[p].v;

    int mid = (l + r) >> 1, res = 0;

    if (x <= mid)
        res += query(ls, l, mid, x, y);

    if (mid < y)
        res += query(rs, mid + 1, r, x, y);

    return res;
}

vector<int> g[N << 1], e[N << 1];

void dfs(int u) {
    for (int i = 0; i < g[u].size(); i++) {
        int v = g[u][i];
        dfs(v);
        merge(rt[u], rt[u], rt[v], 1, n);
    }
}

void dfs2(int u) {
    for (int i = 0; i < e[u].size(); i++) {
        int v = e[u][i];
        dfs2(v);

        if (mx[v])
            mx[u] = t2.t[u].len;
    }
}

int m;

char b[N];

bool inline check(int p, int len) {
    if (p == 0)
        return false;

    return query(rt[p], 1, n, l + len - 1, r) > 0;
}

int main() {
    scanf("%s%d", s + 1, &q);
    n = strlen(s + 1);
    t1.clear();

    for (int i = 1; i <= n; i++)
        t1.insert(s[i] - 'a', i);

    for (int i = 1; i <= n; i++)
        change(rt[pos[i]], 1, n, i);

    for (int i = 1; i <= t1.idx; i++)
        g[t1.t[i].link].push_back(i);

    dfs(1);

    while (q--) {
        scanf("%s%d%d", b + 1, &l, &r);
        m = strlen(b + 1);
        t2.clear();

        for (int i = 1; i <= m; i++)
            t2.insert(b[i] - 'a');

        for (int i = 1; i <= t2.idx; i++)
            e[t2.t[i].link].push_back(i);

        int p = 1, q = 1;

        for (int i = 1, j = 0; i <= m; i++) {
            int c = b[i] - 'a';

            while (p != 1 && !check(t1.t[p].ch[c], j + 1)) {
                j--;

                if (j <= t1.t[t1.t[p].link].len) {
                    p = t1.t[p].link;
                }

                while (q != 1 && j <= t2.t[t2.t[q].link].len) {
                    q = t2.t[q].link;
                }
            }

            if (check(t1.t[p].ch[c], j + 1)) {
                p = t1.t[p].ch[c], j++;
                q = t2.t[q].ch[c];
            }

            mx[q] = max(mx[q], j);
        }

        dfs2(1);
        LL ans = 0;

        for (int i = 2; i <= t2.idx; i++) {
            if (mx[i])
                ans += t2.t[i].len - mx[i];
            else
                ans += t2.t[i].len - t2.t[t2.t[i].link].len;
        }

        printf("%lld\n", ans);

        for (int i = 0; i <= t2.idx; i++)
            e[i].clear();
    }

    return 0;
}