Tracking Robots

Several robots move around inside an area and send their positions to a server. The server sees only the stream of positions and has to work out how many robots are in the area.

The area is a closed polygon cut into non overlapping regions labeled $1, \dots, N$. Every robot begins in region $1$ and then starts moving around. A robot moves only into a region adjacent to the one it is in, and every time it enters a new region it sends that region's label to the server. A robot may enter and leave the same region many times.

The server receives one long stream of region labels and does not know which robot sent each label.

Assume every robot sent a region label at least once. Find the minimum and the maximum number of robots that could have produced the stream.

The input holds several test cases. The first line of a test case has the number of regions $N$ ($1 \le N \le 100$) and the length of the server's stream $M$ ($1 \le M \le 200$). Each of the next $N$ lines describes one region, and the $i$th of them describes region $i$. Such a line starts with $c_i$, the number of regions adjacent to region $i$, followed by the $c_i$ labels of those regions. The next line has the $M$ region labels of the stream, in the order the server received them. The input ends with a line containing 0 0.

The given stream is always one that some group of robots could really have produced.

For each test case print one line with the minimum and the maximum possible number of robots in the area, separated by a space.