B"You are given a string s , consisting of lowercase Latin letters. You are asked q queries about it: given another string t , consisting of lowercase Latin letters, perform the following steps: The prefix function of a string a is a sequence p_1, p_2, ... , p_{|a|} , where p_i is the maximum value of k such that k < i and a[1..k]=a[i-k+1..i] ( a[l..r] denotes a contiguous substring of a string a from a position l to a position r , inclusive). In other words, it's the longest proper prefix of the string a[1..i] that is equal to its suffix of the same length. The first line contains a non-empty string s ( 1 <= |s| <= 10^6 ), consisting of lowercase Latin letters. The second line contains a single integer q ( 1 <= q <= 10^5 ) -- the number of queries. Each of the next q lines contains a query: a non-empty string t ( 1 <= |t| <= 10 ), consisting of lowercase Latin letters. For each query, print the values of the prefix function of a string s+t on positions |s|+1, |s|+2, ... , |s|+|t| . "...