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

const int N = 1e6 + 29;

string s, t[N];

int ql[N], qr[N], m, n, ptr[N], cnt = 1, lst = 1;

struct node
{
	int c[29], len, fail;
	int& operator[] (const int& x)
	{
		return c[x];
	}
}tr[N];

namespace sgt
{
	struct node
	{
		int l, r, x;	
	}tr[N << 2];
	#define ls (p << 1)
	#define rs ((p << 1) | 1)
	void bd(int l, int r, int p = 1)
	{
		tr[p] = {l, r, 0};
		int mid = (l + r) >> 1;
		if (l ^ r)
			bd(l, mid, ls), bd(mid + 1, r, rs);
	}
	void up(int sx, int x, int p = 1)
	{
		int l = tr[p].l, r = tr[p].r, mid = (l + r) >> 1;
		tr[p].x = max(tr[p].x, x);
		if (l == r)
			return;
		up(sx, x, (sx <= mid) ? ls : rs);
	}
	int ask(int sl, int sr, int p = 1)
	{
		int l = tr[p].l, r = tr[p].r, mid = (l + r) >> 1, res = 0;
		if (l >= sl && r <= sr)
			return tr[p].x;
		if (sl <= mid)
			res = ask(sl, sr, ls);
		if (sr > mid)
			res = max(res, ask(sl, sr, rs));
		return res;
	}
	#undef ls
	#undef rs
}

namespace Tree
{
	vector < int > E[N];
	int dfn[N], en[N], idx;
	void dfs(int u)
	{
		dfn[u] = ++ idx;
		for (int v : E[u])
			dfs(v);
		en[u] = idx;
	}
	void init()
	{
		for (int i = 2;i <= cnt;++ i)
			E[tr[i].fail].push_back(i);
		dfs(1), sgt::bd(1, idx);
	}
	void up_p(int p, int x)
	{
		sgt::up(dfn[p], x);
	}
	int ask_p(int p)
	{
		return sgt::ask(dfn[p], en[p]);
	}
}

using Tree::up_p;
using Tree::ask_p;

void ins(int c)
{
	int cur = ++ cnt, p = lst;
	tr[cur].len = tr[p].len + 1;
	while (p && !tr[p][c])
		tr[p][c] = cur, p = tr[p].fail;
	int q = tr[p][c];
	if (!p)
		tr[cur].fail = 1;
	else if (tr[q].len == tr[p].len + 1)
		tr[cur].fail = q;
	else
	{
		int x = ++ cnt;
		tr[x] = tr[q], tr[x].len = tr[p].len + 1;
		while (p && tr[p][c] == q)
			tr[p][c] = x, p = tr[p].fail;
		tr[cur].fail = tr[q].fail = x;
	}
	lst = cur;
}

LL ans[N];

vector < int > Q[N];

int lp[N], bel[N], vis[N];

namespace SA
{
	string s;
	int sa[N], rk[N], rk1[N], ht[N], cnt[N], a[N];
	void srt(int w)
	{
		for (int i = 0;i <= n;++ i)
			cnt[i] = 0;
		for (int i = 1;i <= n;++ i)
			++ cnt[rk[sa[i] + w] + 1];
		for (int i = 1;i <= n;++ i)
			cnt[i] += cnt[i - 1];
		for (int i = 1;i <= n;++ i)
			a[++ cnt[rk[sa[i] + w]]] = sa[i];
		for (int i = 1;i <= n;++ i)
			sa[i] = a[i];
	}
	void init(const string& t)
	{
		s = t;
		for (int i = 1;i <= n;++ i)
			++ cnt[rk[i] = s[i] - 'a' + 1];
		for (int i = 1;i <= 30;++ i)
			cnt[i] += cnt[i - 1];
		for (int i = 1;i <= n;++ i)
			sa[++ cnt[rk[i] - 1]] = i;
		for (int i = 1;i <= n;++ i)
			rk1[i] = rk[i];
		for (int i = 1, j = 1;i <= n;++ i)
			rk[sa[i]] = (i == n || (rk1[sa[i]] == rk1[sa[i + 1]])) ? j : j ++ ;
		for (int w = 1;w < n;w <<= 1)
		{
			srt(w), srt(0);
			for (int i = 1;i <= n;++ i)
				rk1[i] = rk[i];
			for (int i = 1, j = 1;i <= n;++ i)
				rk[sa[i]] = (i == n || (rk1[sa[i]] == rk1[sa[i + 1]] && rk1[sa[i] + w] == rk1[sa[i + 1] + w])) ? j : j ++;
		}
		for (int i = 1, j = 0;i <= n;++ i)
		{
			if (j)
				-- j;
			while (s[i + j] == s[sa[rk[i] - 1] + j])
				++ j;
			ht[rk[i]] = j;
		}
	}
	void clear()
	{
		for (int i = 0;i <= max(n, 30) + 10;++ i)
			rk1[i] = rk[i] = ht[i] = a[i] = cnt[i] = sa[i] = 0;
	}
}

void work(int id)
{
	int l = ql[id];
	n = (int)t[id].size() - 1;
	vector < int > st;
	for (int i = 1, u = 1, len = 0, c;i <= n;++ i)
	{
		lp[i] = 0;
		c = t[id][i] - 'a' + 1;
		while (u && !tr[u][c])
			len = tr[u = tr[u].fail].len;
		if (!u)
			u = 1, len = 0;
		else
			++ len, u = tr[u][c];
		int p = u;
		vector < int > st1;
		while (p && ask_p(p) - tr[tr[p].fail].len < l)
		{
			if (vis[p])
			{
				p = bel[p];
				break;
			}
			st1.push_back(p);
			p = tr[p].fail;
		}
		for (int x : st1)
			vis[x] = 1, bel[x] = p, st.push_back(x);
		int tt = (p == u) ? len : tr[p].len;
		lp[i] = max(0, min(tt, ask_p(p) - l + 1));
	}
	reverse(lp + 1, lp + 1 + n);
	reverse(t[id].begin() + 1, t[id].end());
	LL res = 0;
	SA::init(t[id]);
	for (int i = 1;i <= n;++ i)
		res += max(0, n - i + 1 - max(SA::ht[SA::rk[i]], lp[i]));
	ans[id] = res;
	for (int x : st)
		bel[x] = vis[x] = 0;
	SA::clear();
}

int main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> s >> m, s = "$" + s;
	for (int i = 1;i <= m;++ i)
		cin >> t[i] >> ql[i] >> qr[i], t[i] = "$" + t[i], Q[qr[i]].push_back(i);
	for (int r = 1;r < (int)s.size();++ r)
		ins(s[r] - 'a' + 1), ptr[r] = lst;
	Tree::init();
	for (int r = 1;r < (int)s.size();++ r)
	{
		up_p(ptr[r], r);
		for (int id : Q[r])
			work(id);
	}
	for (int i = 1;i <= m;++ i)
		cout << ans[i] << "\n";
	cout.flush();
	
	return 0;
}