The local building firm needs your help. They are building an apartment building where the walls are prefabricated and lifted in place using cranes. The building firm has located $n$ possible locations for cranes, and needs to choose some of these so that the center of each wall can be reached by at least one crane. The cranes are quite expensive, so they want to use as few of them as possible. A crane can reach a wall if the wall’s center is at most a distance $r$ away.
The house that is to be built is rectangular with a length $\ell $ and width $w$.
Find the minimum number of cranes required to reach the center of all four walls.
The first line of input contains four space-separated positive integers $\ell $, $w$, $n$ and $r$, all at most 30. $\ell $ and $w$ denote the length and width of the house, $n$ denotes the number of possible crane locations, and $r$ denotes the reaching distance of each crane.
This is followed by $n$ lines, each containing two integers $x$ and $y$ ($-100\leq x,y\leq 100$), denoting a possible location for a crane. The coordinate system has its origin in the center of the building and the $x$-coordinate along the length of the house. The walls thus have their centers at $(x,y)=(-\ell /2,0),(\ell /2,0),(0,-w/2),(0,w/2)$.
Output one integer, the minimum number of cranes required to reach all wall segments, or Impossible if not all wall segments can be reached.
|Sample Input 1||Sample Output 1|
4 2 3 3 1 -2 4 0 -1 2
|Sample Input 2||Sample Output 2|
6 1 1 1 1 0