#include<bits/stdc++.h>
using namespace std;
char s[100005];
int tr[100005][30],fail[100005],fa[100005];
int dfn[100005],dfr[100005],ed[1005],id[100005];
int n,m,tot,cnt;
queue<int>q;
vector<int>T[100005];
int r[1005][1005],pre[1005][1005];
void dfs(int x){
	dfr[x]=dfn[x]=++cnt;
	// printf("dfn[%d]=%d\n",x,cnt);
	for(int v:T[x]){
		dfs(v);
		dfr[x]=dfr[v];
	}
}
int ft[100005];
inline int lowbit(int x){return x&(-x);}
void add(int x,int v){
	// printf("add %d %d\n",x,v);
	for(;x<=cnt;x+=lowbit(x))ft[x]+=v;
}
int query(int x){
	int ans=0;
	// printf("query %d\n",x);
	for(;x;x-=lowbit(x))ans+=ft[x];
	return ans;
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%s",s+1);
		int len=strlen(s+1);
		int cur=0;
		for(int j=1;j<=len;j++){
			int c=s[j]-'a';
			if(!tr[cur][c]){
				tr[cur][c]=++tot;
				fa[tot]=cur;
			}
			cur=tr[cur][c];
		}
		ed[i]=cur;
		id[cur]=i;
	}
	for(int i=0;i<26;i++)if(tr[0][i])q.push(tr[0][i]);
	while(!q.empty()){
		int f=q.front();
		q.pop();
		// printf("%d\n",f);
		for(int i=0;i<26;i++){
			if(tr[f][i]){
				fail[tr[f][i]]=tr[fail[f]][i];
				// printf("%d %c to %d\n",f,i+'a',tr[f][i]);
				q.push(tr[f][i]);
			}
			else tr[f][i]=tr[fail[f]][i];
		}
	}
	// for(int i=1;i<=tot;i++)printf("fail[%d]=%d\n",i,fail[i]);
	for(int i=1;i<=tot;i++)T[fail[i]].push_back(i);
	dfs(0);
	// cnt=tot+1
	for(int i=1;i<=n;i++){
		int cur=ed[i];
		while(cur){
			add(dfn[cur],1);
			cur=fa[cur];
		}
		for(int j=1;j<=n;j++){
			r[j][i]=query(dfr[ed[j]])-query(dfn[ed[j]]-1);
			// printf("r[%d][%d]=%d\n",j,i,r[j][i]);
			pre[j][i]=pre[j][i-1]+r[j][i];
		}
		cur=ed[i];
		while(cur){
			add(dfn[cur],-1);
			cur=fa[cur];
		}
	}
	while(m--){
		int l,r,x;
		scanf("%d%d%d",&l,&r,&x);
		printf("%d\n",pre[x][r]-pre[x][l-1]);
	}
	return 0;
}
// quod erat demonstrandum