OpenKattis
Reykjavik University

# Basin City Surveillance

Don McCullough, cc-by-2.0

Basin City is known for her incredibly high crime rates. The police see no option but to tighten security. They want to install traffic drones at different intersections to observe who’s running on a red light. If a car runs a red light, the drone will chase and stop the car to give the driver an appropriate ticket. The drones are quite stupid, however, and a drone will stop before it comes to the next intersection as it might otherwise lose its way home, its home being the traffic light to which it is assigned. The drones are not able to detect the presence of other drones, so the police’s R&D department found out that if a drone was placed at some intersection, then it was best not to put any drones at any of the neighbouring intersections. As is usual in many cities, there are no intersections in Basin City with more than four other neighbouring intersections.

The drones are government funded, so the police force would like to buy as many drones as they are allowed to. Being the programmer-go-to for the Basin City Police Department, they ask you to decide, for a given number of drones, whether it is feasible to position exactly this number of drones.

## Input

The first line contains an integer $k$ ($0 \leq k \leq 15$), giving the number of drones to position. Then follows one line with $1 \leq n \leq 100\; 000$, the total number of intersections in Basin City. Finally follow $n$ lines describing consecutive intersections. The $i$-th line describes the $i$-th intersection in the following format: The line starts with one integer $d$ ($0 \leq d \leq 4$) describing the number of intersections neighbouring the $i$-th one. Then follow $d$ integers denoting the indices of these neighbouring intersections. They will be all distinct and different from $i$. The intersections are numbered from $1$ to $n$.

## Output

If it is possible to position $k$ drones such that no two neighbouring intersections have been assigned a drone, output a single line containing possible. Otherwise, output a single line containing impossible.

Sample Input 1 Sample Output 1
4
7
2 2 4
3 1 3 5
1 2
2 1 5
4 2 6 4 7
2 5 7
2 6 5

impossible

Sample Input 2 Sample Output 2
4
8
2 2 4
3 1 3 5
1 2
2 1 5
4 2 6 4 7
2 5 8
2 8 5
2 7 6

possible