Define (f(t)) as the maximum number of parts (t) can be split into such that each part is a non-empty prefix of (t). In other words, (f(t)) is the maximum positive integer (k) that satisfies the following condition: There exist (k) strings (p_1,p_2,\ldots,p_k), which are prefixes of (t), such that (t=p_1+p_2+\ldots+p_k). Here (+) denotes the string concatenation. You are given a string (s) of length (n), consisting of only lowercase English letters. Let (sx..y) represent the substring(^{\text{∗}}) of (s) from the (x)-th to the (y)-th character (inclusive). You need to answer (q) queries. The (i)-th query provides two integers (l_i) and (r_i), and you need to find () \sum_{j=l_i}^{r_i} f(sl_i..j). () (^{\text{∗}})A string (a) is a substring of a string (b) if (a) can be obtained from (b) by the deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^3)). The description of the test cases follows. The first line of each test case contains two integers (n) and (q) ((1 \le n \le 10^6), (1 \le q \le 100)). The second line contains the string (s) of length (n), consisting of only lowercase English letters. The (i)-th of the next (q) lines contains two integers (l_i) and (r_i) ((1 \le l_i \le r_i \le n)), representing the (i)-th query. It is guaranteed that the sum of (n) over all test cases does not exceed (10^6). For each query, output an integer representing the value of the expression. In the first test case, (f(a)=1). In the second test case, (f(a)+f(aa)+f(aaa)+f(aaaa)+f(aaaaa)=1+2+3+4+5=15) and $$$f(a)+f(aa)+f(\textt