From Hacks to Snitches

문제

As one can’t make a living from the prizes awarded at computer science competitions, you have decided to get into the art business—or, more precisely, into a certain museum you have chosen for your debut as an art thief. Unfortunately, this museum is guarded quite well: there are $KK$ watchmen patrolling the building, each touring on his own simple closed path through the museum.

To coordinate your operation, you use a map of the area which describes the museum as a set of $MM$ corridors connecting $NN$ corners, numbered from 1 to $NN$. You start at corner 1, whereas your target—a valuable exhibit—is located at corner $NN$. Of course, one can reach any corner of the museum from any other corner, but you are not sure whether this is possible without getting noticed, that is, without ever being at the same corner as a watchman and without passing a watchman in a corridor.

Fortunately, you got your hands on the guard roster. So you know for each watchman where he is located at the beginning and which route he is taking. Each minute, a watchman moves from his current position to the next corner on his route, and you can either stay at your current position or move to an adjacent corner. You observed that no two of the watchmen’s routes intersect and that neither your starting position nor your target is contained in any of them.

Write a program that uses this information to either calculate the minimum amount of time in minutes you need to safely reach your target^* without being noticed^† or to decide that this is impossible.

^* Once you reach the exhibit, you will open a window and leave the museum by means of the fancy wingsuit you won in your national computer science competition, so there is no need to plan a safe route back.

^† Of course, you are a gentleman thief who would never lay a finger on the watchmen!

입력

The first line of input contains the integers $NN$ and $MM$ described above. The following $MM$ lines each contain two integers $uu$ and $vv$ ($1\le u,v\le N1\; \backslash le\; u,\; v\; \backslash le\; N$, $u\mathrm{\ne }vu\; \backslash ne\; v$), meaning that there is a corridor directly connecting corners $uu$ and $vv$. It is guaranteed that at most one corridor directly connects any two given corners.

The next line contains the single integer $KK$ described above. Then $KK$ lines follow; the $ii$^th of these lines contains a sequence of integers, describing the route of the $ii$^th watchman as follows: The first integer ${\mathrm{\ell }}_i\backslash ell\_i$ gives the number of distinct corners on the route. Then ${\mathrm{\ell }}_i\backslash ell\_i$ pairwise distinct integers $v_1,\cdots ,v_{{\mathrm{\ell }}_i}v\_1,\; \backslash cdots\; ,\; v\_\{\backslash ell\_i\}$specify the sequence of corners the watchman passes on his route. More precisely, the watchman starts at corner $v_{1}v\_1$, in one minute he will be at $v_{2}v\_2$, and so on; after ${\mathrm{\ell }}_i\backslash ell\_i$ minutes he will be at $v_{1}v\_1$ again.

출력

Your program should output a single line. This should consist of an integer, the minimum amount of time in minutes you need to safely reach your target, or the string impossible if there is no way to achieve this.

힌트

The following picture corresponds to the situation of the first sample case above:

Here, the corner where the watchman is located at the beginning is shown in bold and his route is indicated by shoe prints. An optimal route for you would be the following: you wait at your starting location (corner 1) for one minute, and then go to corners 2, 5, and finally 6 without further delay.

The second sample has the same museum layout, but the starting location and direction of the watchman differ. A possible optimal route: go from 1 to 2, 3, 4, 5, and finally 6.

6 6
1 2
2 3
3 4
4 5
5 2
5 6
1
4 3 2 5 4

4

6 6
1 2
2 3
3 4
4 5
5 2
5 6
1
4 4 5 2 3

5

11 13
1 2
2 3
3 4
4 2
3 5
5 6
6 7
7 5
6 8
8 9
9 10
10 8
9 11
3
3 4 2 3
3 7 6 5
3 10 8 9

impossible