#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int son[200005][30], cnt, ed[200005], n, fail[200005], ans, u, num[200005], maxa, in[200005], a[1005][1005], m, inn[200005];
string moshi[1005];
string s;
queue<int> que;
void add(int op) {
	int w = 0;
	for (int i = 0; i < moshi[op].length(); i++) {
		if (son[w][moshi[op][i] - 'a'] != 0) {
			w = son[w][moshi[op][i] - 'a'];
		} else {
			son[w][moshi[op][i] - 'a'] = ++cnt;
			w = cnt;
		}
	}
	ed[op] = w;
}
void build() {
	queue<int> q;
	for (int i = 0; i < 26; i++) {
		if (son[0][i] != 0) {
			q.push(son[0][i]);
		}
	}
	while (q.size()) {
		int p = q.front();
		q.pop();
		for (int i = 0; i < 26; i++) {
			if (son[p][i] != 0) {
				fail[son[p][i]] = son[fail[p]][i];
				q.push(son[p][i]);
			} else {
				son[p][i] = son[fail[p]][i];
			}
		}
	}
}
inline void topo() {
	for (int i = 0; i <= cnt; i++) inn[i] = in[i];
	while (que.size()) que.pop();
	for (int i = 0; i <= cnt; i++) {
		if (!inn[i]) que.push(i);
	}
	int u;
	while (que.size()) {
		u = que.front();
		num[fail[u]] += num[u];
		inn[fail[u]]--;
		que.pop();
		if (inn[fail[u]] == 0) {
			que.push(fail[u]);
		}
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> moshi[i];
		add(i);
	}
	build();
	for (int i = 1; i <= cnt; i++) {
		in[fail[i]]++;
	}
	for (int i = 1; i <= n; i++) {
		memset(num, 0, sizeof(num));
		u = 0;
		for (int j = 0; j < moshi[i].size(); j++) {
			u = son[u][moshi[i][j] - 'a'];
			num[u]++;
		}
		topo();
		for (int j = 1; j <= n; j++) {
			a[j][i] = num[ed[j]] + a[j][i - 1];
		}
	}
	int p, q, w;
	for (int i = 1; i <= m; i++) {
		cin >> p >> q >> w;
		cout << a[w][q] - a[w][p - 1] << "\n";
	}
	return 0;
}