E-Mail Snooping

An intelligence agency stores far more e-mail than any team of people could read, so the first pass is done by a program. Here you write a very simple version of that first pass.

Assume every e-mail consists only of words made up of lowercase letters, together with commas, periods, and whitespace (space, tab, newline). A word is a maximal run of lowercase letters. The agency keeps a list of keywords that raise alarms. If at least a certain number of distinct keywords from that list occur in the text, each at least once, the e-mail raises an alarm.

Write a program that determines which e-mails raise alarms.

The first line is the number $K$ of data sets, followed by the $K$ data sets, each of the following form.

The first line contains three integers $n$, $k$, $t$, separated by spaces. $1 \le n \le 100$ is the number of words that raise alarms, $1 \le k \le 100$ is the number of lines in the e-mail that follows, and $1 \le t \le 100$ is the number of keywords that need to occur to raise an alarm.

This is followed by $n$ lines, each containing a word of at most 20 lowercase letters and no other characters. Next come $k$ lines, each containing at most 80 characters, a mix of lowercase letters, commas, periods, and different forms of spaces. No word breaks across lines: a newline character ends a word, and a new word starts on the next line. Only exact matches count, so contest and contests do not match.

For each data set, print Data Set x: on a line by itself, where $x$ is the number of the data set, starting at 1. On the next line print Alarm if the number of distinct keywords found in the e-mail is at least $t$, and No Alarm otherwise. Print an empty line after each data set.