#include <bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long

const int N = 1e5 + 5;
int n, m;
string s[N];
struct Tree {
	int fail;
	int ch[26];
} t[N];
int tot;
int ed[N];
int ins(string s) {
	int u = 0;
	for (auto x : s) {
		if (!t[u].ch[x - 'a']) t[u].ch[x - 'a'] = ++tot;
		u = t[u].ch[x - 'a'];
	}
	return u;
}

void build() {
	queue <int> q;
	int u = 0;
	for (int i = 0; i < 26; i++) {
		if (t[u].ch[i]) {
			q.push(t[u].ch[i]);
			t[t[u].ch[i]].fail = 0;
		}
	}
	while (!q.empty()) {
		u = q.front();
		q.pop();
		for (int i = 0; i < 26; i++) {
			if (t[u].ch[i]) {
				q.push(t[u].ch[i]);
				t[t[u].ch[i]].fail = t[t[u].fail].ch[i];
			} else t[u].ch[i] = t[t[u].fail].ch[i];
		}
	}
}

vector <int> e[N];
int L[N], R[N], tim;
void dfs(int u) {
	L[u] = ++tim;
	for (auto v : e[u]) dfs(v);
	R[u] = tim;
}
vector < pair <int, int> > add[N], del[N];
int ans[N];
int tr[N];
void upd(int x) {
	for (; x <= tot + 1; x += x & (-x)) tr[x]++;
}
int query(int x) {
	int res = 0;
	for (; x; x -= x & (-x)) res += tr[x];
	return res;
}
int query(int l, int r) {
	return query(r) - query(l - 1);
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> s[i], ed[i] = ins(s[i]);
	build();
	for (int i = 1; i <= tot; i++) e[t[i].fail].push_back(i);
	dfs(0);
	for (int i = 1; i <= m; i++) {
		int l, r, k;
		cin >> l >> r >> k;
		del[l - 1].push_back({k, i});
		add[r].push_back({k, i});
	}
	for (int i = 1; i <= n; i++) {
		int u = 0;
		for (auto x : s[i]) {
			u = t[u].ch[x - 'a'];
			upd(L[u]);
		}
		for (auto qwq : del[i]) ans[qwq.second] -= query(L[ed[qwq.first]], R[ed[qwq.first]]);
		for (auto qwq : add[i]) ans[qwq.second] += query(L[ed[qwq.first]], R[ed[qwq.first]]);		
	}
	for (int i = 1; i <= m; i++) cout << ans[i] << '\n';
	QwQ330AwA;
}