Opening Ceremony

The Olympic games start with an opening ceremony. The athletes of every participating country march around the main stadium. A country normally marches as one bloc, so the organizers can see at a glance which country has the most athletes missing. Call an athlete who registered but skipped the ceremony to train instead a delinquent.

At this ceremony the athletes marched mixed together, in no country order. Counting now means reading every jersey and keeping a separate tally per country.

You are given how many athletes each country registered, followed by the country of every athlete who marched, in order. Find the largest number of delinquents of any country.

The first line contains the number of data sets $K$, with $K \ge 1$. Then follow $K$ data sets in this format.

The first line of a data set contains two integers $c$ and $n$. Here $c$ is the number of participating countries with $1 \le c \le 1000$, and $n$ is the number of athletes who marched in the ceremony with $0 \le n \le 10000$.

The next line contains $c$ integers $m_1, m_2, \dots, m_c$. Here $m_i$ is the number of athletes registered for country $i$, with $m_i \ge 0$.

The next line contains $n$ integers $b_1, b_2, \dots, b_n$. Here $b_j$ is the country of the $j$-th athlete who marched, with $1 \le b_j \le c$. This line is empty when $n$ is 0. No country $i$ ever sends more than $m_i$ athletes to the ceremony.

For each data set, first print Data Set x: on a line by itself, where $x$ is the number of the data set counting from 1. On the next line print the largest number of delinquents of any country in that data set.

Print a blank line after each data set.