#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXQ = 1e5 + 5;
const int MAXM = 5e5 + 1e6 + MAXQ;
const int LB = 21 + 2;
const int LBN = 17 + 2;
const int inf = 0x3f3f3f3f;

inline void chk_max(int &a,int b){ if(a<b) a=b;}

int lb[MAXM];

struct Segment_Tree
{
	int sum[MAXM * LBN], ls[MAXM * LBN], rs[MAXM * LBN], pcnt;
	Segment_Tree(void): pcnt(0) {}
	#define lson(u) ls[u],l,mid
	#define rson(u) rs[u],mid+1,r
	void update(int &u,int v,int l,int r,int q)
	{
		sum[u = ++pcnt] = sum[v] + 1;
		if(l == r) return;
		ls[u] = ls[v]; rs[u] = rs[v];
		int mid = (l+r)>>1;
		if(q<=mid) update(ls[u],lson(v),q);
		else update(rs[u],rson(v),q);
	}
	int query(int ul,int ur,int l,int r,int ql,int qr)
	{
		if(!ul && !ur) return 0;
		if(ql<=l && r<=qr) return sum[ur] - sum[ul];
		int mid = (l+r)>>1, res = 0;
		if(ql<=mid) res += query(ul,lson(ur),ql,qr);
		if(mid<qr) res += query(ul,rson(ur),ql,qr);
		return res;
	}
};

namespace SA
{
	int sa[MAXM], rnk[MAXM], sa_k;
	void sa_sort(int a[],int n)
	{
		if(n == 1){ rnk[a[1]] = a+1-sa; a[1] = -1; return;}
		int p = rnk[a[rand() % n + 1] + sa_k], i = 1, j = 1, k = n, x;
		
		while(i<=k)
		{
			if((x = rnk[a[i] + sa_k]) < p) swap(a[i++], a[j++]);
			else if(x > p) swap(a[i], a[k--]);
			else ++i;
		}
		
		if(j > 1) sa_sort(a,j-1);
		rnk[a[j]] = x = a + k - sa;
		if(j == k) a[j] = -1;
		else while(j<k) rnk[a[++j]] = x;
		if(k < n) sa_sort(a+k,n-k);
	}
	int n, st[MAXM][LB];
	void get_sa(char s[],int _n)
	{
		n = _n;
		for(int i=1; i<=n; ++i) sa[i] = i, rnk[i] = s[i];
		rnk[n+1] = 0;
		sa_k = 0; sa_sort(sa,n);
		for(int &k=sa_k=1; sa[1]>-n; k<<=1)
		{
			int len = 0;
			for(int i=1; i<=n;)
			{
				if(sa[i] < 0){ len += sa[i]; i -= sa[i]; continue;}
				if(len) sa[i+len] = len, len = 0;
				int j = rnk[sa[i]] + 1;
				sa_sort(sa+i-1, j-i);
				i = j;
			}
			if(len) sa[n+1+len] = len;
		}
		for(int i=1; i<=n; ++i) sa[rnk[i]] = i;
 	
		for(int i=1,k=0; i<=n; ++i)
		{
			if(rnk[i] == n){ st[n][0] = k = 0; continue;}
			if(k) --k;
			int j = sa[rnk[i] + 1];
			while(s[i+k] == s[j+k]) ++k;
			st[rnk[i]][0] = k;
		}
		
		for(int i=n; i>=1; --i)
			for(int j=1; i+(1<<j)-1 <= n; ++j)
				st[i][j] = min(st[i][j-1], st[i+(1<<(j-1))][j-1]);
	}
	inline int get_min(int l,int r){ int k = lb[r-l+1]; return min(st[l][k], st[r-(1<<k)+1][k]);}
	inline int lcp(int x,int y)// idx
	{
		if(x == y) return inf;
		x = rnk[x]; y = rnk[y];
		return x<y? get_min(x,y-1): get_min(y,x-1);
	}
	inline pii get_range(int x,int len)// rnk
	{
		int l = x, r = x;
		for(int i=lb[l-1]; i>=0; --i)
			if(i<=lb[l-1] && st[l-(1<<i)][i] >= len) l -= (1<<i);
		for(int i=lb[n-r]; i>=0; --i)
			if(i<=lb[n-r] && st[r][i] >= len) r += (1<<i);
		return make_pair(l,r);
	}
};

int a[MAXM][LB];

char s[MAXM];
pii p[MAXQ];
int beg[MAXQ], unt[MAXQ];

inline bool cmp(int x,int y){ return SA::rnk[x] < SA::rnk[y];}

int main(void)
{
	lb[0] = -1;
	for(int i=2; i<MAXM; ++i) lb[i] = lb[i>>1] + 1;
	
	int Q;
	scanf("%s%d",s+1,&Q);
	int n = strlen(s+1), m = n;
	for(int i=1; i<=Q; ++i)
	{
		s[++m] = '$';
		scanf("%s%d%d",s+m+1,&p[i].first,&p[i].second);
		beg[i] = ++m;
		while(s[m+1]) ++m;
		unt[i] = m;
	}
	
	SA::get_sa(s,m);
	using SA::sa; using SA::rnk; using SA::lcp; using SA::get_range;
	
	static Segment_Tree tree;
	static int root[MAXM];
	
	for(int i=1; i<=m; ++i)
	{
		if(sa[i] > n) root[i] = root[i-1];
		else tree.update(root[i], root[i-1], 1,n, sa[i]);
	}
	
	for(int k=1; k<=Q; ++k)
	{
		static int f[MAXM];
		int l = beg[k], r = unt[k], len = r-l+1;
		for(int i=l, j=0; i<=r; ++i)
		{
			if(!j) j = 1;
			while(i+j-1 <= r)
			{
				int lb = p[k].first, rb = p[k].second - j + 1;
				if(lb > rb) break;
				pii rng = get_range(rnk[i], j);
				if(tree.query(root[rng.first-1],root[rng.second],1,n,lb,rb) == 0) break;
				++j;
			}
			f[i] = --j;
		}
		
		static int id[MAXM];
		for(int i=l; i<=r; ++i) id[i] = i;
		sort(id+l, id+r+1, cmp);
		
		for(int i=l+1; i<=r; ++i)
			chk_max(f[id[i]], lcp(id[i], id[i-1]));
		
		ll ans = (ll)len * (len-1) / 2 + len;
		for(int i=l; i<=r; ++i) ans -= f[i];
		
		printf("%lld\n",ans);
	}
	return 0;
}