The Scariest Story (Basic)

Little Jack wants to write the scariest story to frighten his friends on Halloween.

A story is a non-empty sequence of words separated by spaces. A word is a non-empty sequence of lowercase Latin letters.

The quality of a story depends not only on the words in it but also on the characters in those words.

Jack has already written a story of $n$ words. Now he wants to test $m$ hypotheses about it to confirm that it is really scary. For each hypothesis, he must find, given the position of a character in the story, the number of the word that contains it and the position of that character within the word.

The first line contains two integers $n$ and $m$ separated by a space, the number of words in the story and the number of hypotheses ($1 \leq n \leq 10^5$; $1 \leq m \leq 5 \times 10^5$).

The next line contains the story: $n$ words of lowercase Latin letters separated by spaces. The total length of all words does not exceed $10^6$.

The last line contains $m$ integers $x_i$ separated by spaces, the character positions in the hypotheses ($1 \leq x_i \leq \sum_{i=1}^n |s_i|$).

Print $m$ pairs of numbers, one pair per line. The pair on line $i$ is the number of the word that contains the $i$-th character and the number of that character within the word. Words and characters are numbered from 1.