# Problem C

Surveillance

The International Corporation for Protection and Control (ICPC) develops efficient technology for, well, protection and control. Naturally, they are keen to have their own headquarters protected and controlled. Viewed from above, the headquarters building has the shape of a convex polygon. There are several suitable places around it where cameras can be installed to monitor the building. Each camera covers a certain range of the polygon sides (building walls), depending on its position. ICPC wants to minimize the number of cameras needed to cover the whole building.

## Input

The input consists of a single test case. Its first line contains two integers $n$ and $k$ ($3 \le n \le 10^6$ and $1 \le k \le 10^6$), where $n$ is the number of walls and $k$ is the number of possible places for installing cameras. Each of the remaining $k$ lines contains two integers $a_ i$ and $b_ i$ ($1 \le a_ i, b_ i \le n$). These integers specify which walls a camera at the $i^{th}$ place would cover. If $a_ i \le b_ i$ then the camera covers each wall $j$ such that $a_ i \le j \le b_ i$. If $a_ i > b_ i$ then the camera covers each wall $j$ such that $a_ i \le j \le n$ or $1 \le j \le b_ i$.

## Output

Display the minimal number of cameras that suffice to cover
each wall of the building. The ranges covered by two cameras
may overlap. If the building cannot be covered, display
`impossible` instead.

Sample Input 1 | Sample Output 1 |
---|---|

100 7 1 50 50 70 70 90 90 40 20 60 60 80 80 20 |
3 |

Sample Input 2 | Sample Output 2 |
---|---|

8 2 8 3 5 7 |
impossible |

Sample Input 3 | Sample Output 3 |
---|---|

8 2 8 4 5 7 |
2 |