Duff is Mad

- 给定 $n$ 个字符串 $s_{1 \dots n}$。 - $q$ 次询问 $s_{l \dots r}$ 在 $s_k$ 中出现了多少次。 - $n,q,\sum_{i=1}^n |s_i| \le 10^5$。

Duff is mad at her friends. That's why she sometimes makes Malek to take candy from one of her friends for no reason! She has $ n $ friends. Her $ i $ -th friend's name is $ s_{i} $ (their names are not necessarily unique). $ q $ times, she asks Malek to take candy from her friends. She's angry, but also she acts with rules. When she wants to ask Malek to take candy from one of her friends, like $ k $ , she chooses two numbers $ l $ and $ r $ and tells Malek to take exactly  candies from him/her, where $ occur(t,s) $ is the number of occurrences of string $ t $ in $ s $ . Malek is not able to calculate how many candies to take in each request from Duff. That's why she asked for your help. Please tell him how many candies to take in each request.

The first line of input contains two integers $ n $ and $ q $ ( $ 1<=n,q<=10^{5} $ ). The next $ n $ lines contain the names. $ i $ -th of them contains an string $ s_{i} $ , consisting of lowercase English letters (). The next $ q $ lines contain the requests. Each of them contains three integers, $ l,r $ and $ k $ (says that Malek should take  candies from Duff's $ k $ -th friend).

Print the answer to each request in one line.

5 5
a
ab
abab
ababab
b
1 5 4
3 5 4
1 5 2
1 5 3
1 4 1

12
6
3
7
1