B'You 've got string s, consisting of small English letters. Some of the English letters are good, the rest are bad. A substring s[l...r] (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89|s|) of string s xe2 x80 x89 xe2 x80 x89= xe2 x80 x89 xe2 x80 x89s1s2...s|s| (where |s| is the length of string s) is string xe2 x80 x89slsl xe2 x80 x89+ xe2 x80 x891...sr. The substring s[l...r] is good, if among the letters xe2 x80 x89sl, xe2 x80 x89sl xe2 x80 x89+ xe2 x80 x891, xe2 x80 x89..., xe2 x80 x89sr there are at most k bad ones (look at the sample 's explanation to understand it more clear). Your task is to find the number of distinct good substrings of the given string s. Two substrings s[x...y] and s[p...q] are considered distinct if their content is different, i.e. s[x...y] xe2 x80 x89 xe2 x89 xa0 xe2 x80 x89s[p...q]. The first line of the input is the non-empty string s, consisting of small English letters, the string 's length is at most 1500 characters. The second line of the input is the string of characters "0" and "1", the length is exactly 26 characters. If the i-th character of this string equals "1", then the i-th English letter is good, otherwise it 's bad. That is, the first character of this string corresponds to letter "a", the second one corresponds to letter "b" and so on. The third line of the input consists a single integer k (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89|s|) -- the maximum acceptable number of bad characters in a good substring. Print a single integer -- the number of distinct good substrings of string s. In the first example there are following good substrings: "a", "ab", "b", "ba", "bab". In the second example there are following good substrings: "a", "aa", "ac", "b", "ba", "c", "ca", "cb".'...