#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 = 5e5 + 100;
int TRIE[maxn][26];
string s[maxn];
int f[maxn], aut[maxn][26], root, nx = 1;
vi tof[maxn];
int h[maxn];
vi ver[maxn];
vi adj[maxn];
int end[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;
			h[nx] = h[v] + 1;
			ver[h[nx]].pb(nx);
			++ nx;
		}
		v = TRIE[v][c];
	}
	::end[x] = v;
}
inline void ahoc(){
	f[root] = root;
	For(h,0,maxn)
		rep(v, ver[h])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;
			}
			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];
int st[maxn], ft[maxn];
int a[maxn], nex = 0;
inline void dfs(int v){
	st[v] = nex;
	rep(x, tof[v])
		a[nex ++] = x;
	rep(u, adj[v])
		dfs(u);
	ft[v] = nex;
}
vi seg[maxn * 4];
inline void segbuild(int id = 1,int l = 0,int r = nex){
	if(r - l < 2){
		seg[id].pb(a[l]);
		return ;
	}
	int mid = (l+r)/2;
	segbuild(L(id), l, mid);
	segbuild(R(id), mid, r);
	merge(all(seg[L(id)]), all(seg[R(id)]), back_inserter(seg[id]));
}
inline int ask(int x, int y, int a,int b,int id = 1,int l = 0,int r = nex){
	if(l >= y or x >= r)
		return 0;
	if(x <= l && r <= y)
		return upper_bound(all(seg[id]), b) - upper_bound(all(seg[id]), a-1);
	int mid = (l+r)/2;
	return ask(x, y, a, b, L(id), l, mid) +
		   ask(x, y, a, b, R(id), mid, r) ;
}
char ch[maxn];
int main(){
	memset(TRIE, -1, sizeof TRIE);
	memset(par, -1, sizeof par);
	ver[0].pb(root);
	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);
	}
	dfs(root);
	segbuild();
	For(i,0,q){
		int l, r, k;
		scanf("%d %d %d", &l, &r, &k);
		-- l, -- k, -- r;
		k = ::end[k];
		printf("%d\n", ask(st[k], ft[k], l, r));
	}
}