// Problem: #2720. 「NOI2018」你的名字
// Contest: LibreOJ
// URL: https://loj.ac/p/2720
// Memory Limit: 1024 MB
// Time Limit: 4000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define dF(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
#define poly vector<int>
#define SZ(x) ((int)x.size())
using namespace std;
void fre(){
	// freopen("name.in","r",stdin),freopen("name.out","w",stdout);
}
template<typename T>inline void chkmax(T &x,const T &y){ x=std::max(x,y); }
template<typename T>inline void chkmin(T &x,const T &y){ x=std::min(x,y); }
const int mod=998244353,maxn=1000005;
int Root[maxn],n,m;
namespace seg{
	int ls[maxn<<6],rs[maxn<<6],tot;
	void update(int &o,int l,int r,int pos){
		if(!o)o=++tot;
		if(l==r)return;
		int mid=(l+r)>>1; (pos<=mid)?update(ls[o],l,mid,pos):update(rs[o],mid+1,r,pos);
	}
	int merge(int x,int y){
		if(!x||!y)return x|y;
		int o=++tot; ls[o]=merge(ls[x],ls[y]),rs[o]=merge(rs[x],rs[y]); return o;
	}
	int query(int o,int l,int r,int ql,int qr){
		if(!o||ql>qr)return 0;
		if(ql<=l&&qr>=r)return 1;
		int mid=(l+r)>>1;
		if(ql<=mid&&query(ls[o],l,mid,ql,qr))return 1;
		if(qr>mid&&query(rs[o],mid+1,r,ql,qr))return 1;
		return 0;
	}
}
vector<int>g[maxn];
struct SAM{
	int fa[maxn],lst=1,tot=1,to[maxn][26],len[maxn],fr[maxn];
	void init(){
		F(i,1,tot)fa[i]=len[i]=0;
		F(i,1,tot)F(j,0,25)to[i][j]=0;
		tot=lst=1;
	}
	void insert(int c,int id=0){
		int v=lst,u=++tot; lst=u,fr[u]=len[u]=len[v]+1;
		if(id)seg::update(Root[u],1,n,id);
		for(;v&&!to[v][c];to[v][c]=u,v=fa[v]);
		if(!v)return fa[u]=1,void();
		int x=to[v][c],y=++tot;
		if(len[v]+1==len[x])return fa[u]=x,--tot,void();
		len[y]=len[v]+1,fa[y]=fa[x],fr[y]=fr[x],fa[x]=fa[u]=y;
		F(i,0,25)to[y][i]=to[x][i];
		for(;v&&to[v][c]==x;to[v][c]=y,v=fa[v]);
	}
	void dfs(int u){
		for(int v:g[u])dfs(v),Root[u]=seg::merge(Root[u],Root[v]);
	}
	void Sol(){
		F(i,2,tot)g[fa[i]].push_back(i); dfs(1);
	}
}A,B;
void Solve_(){
	string t; cin>>t,m=SZ(t),t=' '+t,B.init(); int L,R; cin>>L>>R;
	vector<int>mch(m+1,0);
	int l=0,u=1;
	auto find=[&](int c){
		for(;;){
			const int v=A.to[u][c];
			if(v&&seg::query(Root[v],1,n,L+l,R))return ++l,u=v,void();
			if(!l)return; --l;
			if(A.len[A.fa[u]]==l)u=A.fa[u];
		}
	};
	F(i,1,m)find(t[i]-'a'),mch[i]=l;
	F(i,1,m)B.insert(t[i]-'a');
	ll ans=0;
	F(u,2,B.tot)ans+=max(0,B.len[u]-max(B.len[B.fa[u]],mch[B.fr[u]]));
	cout<<ans<<'\n';
}
void solve(){
	string s; cin>>s,n=SZ(s),s=' '+s;
	F(i,1,n)A.insert(s[i]-'a',i); A.Sol();
	int zsy; cin>>zsy; F(_,1,zsy)Solve_();
}
signed main(){
	fre(),ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int zsy=1;
	F(____,1,zsy)solve();
}