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

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cpx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound(ALL(v), x) - (v).begin())
#define ubv(v, x) (upper_bound(ALL(v), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cerr << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}
template <typename T, typename U>
ostream& operator<<(ostream &os, pair<T, U> p){return os << "(" << p.fs << ", " << p.sn << ")";}

const int X = 100;
const int MOD = 2e9 + 11;
const int MN = 5e5 + 5;

int pws[MN], tmp[MN];

int lcp(int *a, int asz, int *b, int bsz){
    int lo = 0, hi = min(asz, bsz);
    while(lo < hi){
        int mid = (lo+hi+1)/2;
        ll h1 = a[mid] - (ll) a[0]*pws[mid];
        ll h2 = b[mid] - (ll) b[0]*pws[mid];
        if((h1 - h2) % MOD) hi = mid-1;
        else lo = mid;
    }
    return lo;
}

struct SA {
    int sz;
    char *str;
    int hashes[MN];
    int sa[MN], mp[MN];

    bool cmp(int a, int b){
        int l = lcp(hashes+a, sz-a, hashes+b, sz-b);
        return str[a+l] < str[b+l];
    }

    void msort(int l, int r){
        if(r-l <= 1) return;
        int mid = (l+r)/2;
        msort(l, mid);
        msort(mid, r);

        copy(sa+l, sa+r, tmp+l);
        int a = l, b = mid, c = l;
        while(a < mid && b < r) sa[c++] = cmp(tmp[a], tmp[b]) ? tmp[a++] : tmp[b++];
        while(a < mid) sa[c++] = tmp[a++];
        while(b < r) sa[c++] = tmp[b++];
    }

    void init(int inSz, char *inStr){
        sz = inSz, str = inStr;
        FR(i, sz) hashes[i+1] = ((ll) hashes[i]*X + str[i]) % MOD;
        iota(sa, sa+sz, 0);
        msort(0, sz);
        FR(i, sz) mp[sa[i]] = i;
    }

    int lower_bound(char *oStr, int *oHashes, int oSz){
        int lo = 0, hi = sz;
        while(lo < hi){
            int mid = (lo+hi)/2;
            int a = sa[mid];
            int l = lcp(hashes+a, sz-a, oHashes, oSz);
            if(str[a+l] < oStr[l]) lo = mid+1;
            else hi = mid;
        }
        return lo;
    }

    int numCommon(char *oStr, int *oHashes, int oSz){
        int p = lower_bound(oStr, oHashes, oSz);
        int res = 0;
        if(p != sz) res = lcp(hashes+sa[p], sz-sa[p], oHashes, oSz);
        if(p) res = max(res, lcp(hashes+sa[p-1], sz-sa[p-1], oHashes, oSz));
        return res;
    }
};

int n, m, q;
string ss, ts;
SA sSa, tSa;

int main(){
    pws[0] = 1;
    FR(i, MN-1) pws[i+1] = (ll) pws[i] * X % MOD;
    cin.sync_with_stdio(0); cin.tie(0);
    cin >> ss;

    n = SZ(ss);
    sSa.init(n, &ss[0]);

    cin >> q;
    while(q--){
        int l, r;
        cin >> ts >> l >> r;
        l--;
        m = SZ(ts);
        tSa.init(m, &ts[0]);

        ll res = (ll) m*(m+1)/2;
        FR(i, m){
            int p = tSa.mp[i];
            int l1 = 0;
            if(p != m-1){
                int j = tSa.sa[p+1];
                l1 = lcp(tSa.hashes+i, m-i, tSa.hashes+j, m-j);
            }
            int l2 = sSa.numCommon(tSa.str+i, tSa.hashes+i, m-i);
            res -= max(l1, l2);
        }
        cout << res << '\n';
    }
}