Graph Theory

Bobo has an undirected graph $G$ with $n$ vertices labeled by $1, \dots, n$ and $n$ edges. For each $1 \leq i \leq n$, there is an edge between the vertex $i$ and the vertex $(i \bmod n) + 1$. He also has a list of $m$ pairs $(a\_1, b\_1), \dots, (a\_m, b\_m)$.

Now, Bobo is going to choose an $i$ and remove the edge between the vertex $i$ and the vertex $(i \bmod n) + 1$. Let $\delta\_i(u, v)$ be the number of edges on the shortest path between the $u$-th and the $v$-th vertex after the removal. Choose an $i$ to minimize the maximum among $\delta\_i(a\_1, b\_1), \dots, \delta\_i(a\_m, b\_m)$.

Formally, find the value of \min\_{1 \leq i \leq n}\left\\{\max\_{1 \leq j \leq m} \delta\_i(a\_j, b\_j)\right\\}\text{.}

The input consists of several test cases terminated by end-of-file. For each test case,

The first line contains two integers $n$ and $m$.

For the following $m$ lines, the $i$-th line contains two integers $a\_i$ and $b\_i$.

For each test case, output an integer which denotes the minimum value.

• $2 \leq n \leq 2 \times 10^5$
• $1 \leq m \leq 2 \times 10^5$
• $1 \leq a\_i, b\_i \leq n$ for each $1 \leq i \leq m$
• In each input, the sum of $n$ does not exeed $2 \times 10^5$. The sum of $m$ does not exceed $2 \times 10^5$.

For the first case,

Choosing $i = 3$ yields the minimum value $1$.