Good Substring Catalog

A moderation service catalogs substrings from a lowercase message. The service receives a 26-character quality mask: the i-th character says whether the i-th lowercase letter is good or bad. A substring is accepted into the catalog only if it contains at most k bad letters. For each message, count how many distinct accepted substrings exist. Different occurrences of the same text count only once. For example, if the substring ab appears multiple times and is accepted, it contributes one catalog entry. Input Format: The first line contains t. Each case contains the message string s, then the 26-character quality mask, then the integer k. Output Format: For each case, print the number of distinct substrings that contain at most k bad letters.