B'Given the string s of decimal digits (0-9) of length n . A substring is a sequence of consecutive characters of a string. The substring of this string is defined by a pair of indexes -- with its left and right ends. So, each pair of indexes ( l, r ), where 1 <= l <= r <= n , corresponds to a substring of the string s . We will define as v(l,r) the numeric value of the corresponding substring (leading zeros are allowed in it). For example, if n=7 , s= "1003004", then v(1,3)=100 , v(2,3)=0 and v(2,7)=3004 . You are given n , s and an integer w ( 1 <= w < n ). You need to process m queries, each of which is characterized by 3 numbers l_i, r_i, k_i ( 1 <= l_i <= r_i <= n; 0 <= k_i <= 8 ). The answer to the i th query is such a pair of substrings of length w that if we denote them as (L_1, L_1+w-1) and (L_2, L_2+w-1) , then: If there are many matching substring pairs, then find a pair where L_1 is as small as possible. If there are many matching pairs in this case, then minimize L_2 . Note that the answer may not exist. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- number of input test cases. The first line of each test case contains a string s , which contains only the characters 0-9 and has a length n ( 2 <= n <= 2 cdot 10^5 ). The second line contains two integers w, m ( 1 <= w < n, 1 <= m <= 2 cdot 10^5 ), where n -- is the length of the given string s . The number w denotes the lengths of the substrings being searched for, and m is the number of queries to be processed. The following m lines contain integers l_i, r_i, k_i ( 1 <= l_i <= r_i <= n , 0 <= k_i <= 8 ) -- i th query parameters. It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . It is also gu'...