#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Foreach(i, c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define For(i,a,b) for(int (i)=(a);(i) < (b); ++(i))
#define rof(i,a,b) for(int (i)=(a);(i) > (b); --(i))
#define rep(i, c) for(auto &(i) : (c))
#define x first
#define y second
#define pb push_back
#define PB pop_back()
#define iOS ios_base::sync_with_stdio(false)
#define sqr(a) (((a) * (a)))
#define all(a) a.begin() , a.end()
#define error(x) cerr << #x << " = " << (x) <<endl
#define Error(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n";
#define errop(a) cerr<<#a<<" = ( "<<((a).x)<<" , "<<((a).y)<<" )\n";
#define coud(a,b) cout<<fixed << setprecision((b)) << (a)
#define L(x) ((x)<<1)
#define R(x) (((x)<<1)+1)
#define umap unordered_map
#define double long double
typedef long long ll;
typedef pair<int,int>pii;
typedef vector<int> vi;
typedef complex<double> point;
template <typename T> using os =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T>  inline void smax(T &x,T y){ x = max((x), (y));}
template <class T>  inline void smin(T &x,T y){ x = min((x), (y));}
const int maxn = 1e5 + 100;
int TRIE[maxn][26];
string s[maxn];
int f[maxn], aut[maxn][26], root, nx = 1;
vi tof[maxn];
vi adj[maxn];
int end[maxn];
vi ends[maxn];
inline void build(int x){
	int v = root;
	rep(ch, s[x]){
		int c = ch - 'a';
		if(TRIE[v][c] == -1){
			TRIE[v][c] = nx;
			++ nx;
		}
		v = TRIE[v][c];
	}
	::end[x] = v;
	::ends[v].pb(x);
}
inline void ahoc(){
	f[root] = root;
	queue<int> q;
	q.push(root);
	while(!q.empty()){
		int v = q.front();
		q.pop();
		For(c,0,26){
			if(TRIE[v][c] != -1){
				aut[v][c] = TRIE[v][c];	
				if(v != root)
					f[aut[v][c]] = aut[f[v]][c];
				else
					f[aut[v][c]] = root;
				q.push(TRIE[v][c]);
			}
			else{
				if(v == root)
					aut[v][c] = root;
				else
					aut[v][c] = aut[f[v]][c];
			}
		}
	}
}
inline void go(int x){
	int v = root;
	rep(ch, s[x]){
		int c = ch - 'a';
		v = aut[v][c];
		tof[v].pb(x);
	}
}
int par[maxn];
char ch[maxn];
const int K = 350;
struct sqrt_decomposition{
	ll sum[maxn] = {}, tot[K] = {};
	inline void add(int p, ll val){
		while(p < maxn && p % K)
			sum[p ++] += val;
		while(p < maxn){
			tot[p/K] += val;
			p += K;
		}
	}
	inline ll ask(int p){
		return (p < 0 ? 0 : sum[p] + tot[p/K]);
	}
}SQRT;
struct query{
	int l, r, k;
	ll ans = 0LL;
	query(){}
	query(int L, int R, int K){
		l = L;
		r = R;
		k = K;
	}
}Q[maxn];
vi queries[maxn];
inline void dfs(int v){
	rep(a, ::ends[v])
		SQRT.add(a, 1);
	rep(i, tof[v])	if((int)s[i].size() < K){
		rep(j, queries[i])
			Q[j].ans += SQRT.ask(Q[j].r) - SQRT.ask(Q[j].l - 1);
	}
	rep(u, adj[v])	dfs(u);
	rep(a, ::ends[v])
		SQRT.add(a, -1);
}
ll ps[maxn];
inline int dfs(int v, int x){
	int cnt = 0;
	rep(a, tof[v])	if(a == x)
		++ cnt;
	rep(u, adj[v])
		cnt += dfs(u, x);
	rep(a, ::ends[v])
		ps[a] += (ll)cnt;
	return cnt;
}
int main(){
	memset(TRIE, -1, sizeof TRIE);
	memset(par, -1, sizeof par);
	int n, q;
	scanf("%d %d", &n, &q);
	For(i,0,n){
		scanf("%s", ch);
		s[i] = (string)ch;
		build(i);
	}
	ahoc();
	For(i,0,n)
		go(i);
	For(i,1,nx){
		par[i] = f[i];
		adj[par[i]].pb(i);
	}
	For(i,0,q){
		int l, r, k;
		scanf("%d %d %d", &l, &r, &k);
		-- l, -- r, -- k;
		Q[i] = query(l, r, k);
		queries[k].pb(i);
	}
	For(i,0,n)	if((int)s[i].size() >= K){
		fill(ps, ps + maxn, 0LL);
		dfs(root, i);
		For(i,1,maxn)
			ps[i] += ps[i-1];
		rep(j, queries[i])
			Q[j].ans += ps[Q[j].r] - (Q[j].l ? ps[Q[j].l-1] : 0LL);
	}
	dfs(root);
	For(i,0,q)
		printf("%lld\n", Q[i].ans);
	return 0;
}