Paths in multigraph

Input

The first line contains an integer $n$ (2 \leq n \leq 100) - the number of vertices in $G$. The vertices of the multigraph $G$ are numbered from $1$ to $n$. The second line contains an integer $m$ (0 \leq m \leq 3000) - the number of edges in $G$. The next $m$ lines contain the endpoints $u$ and $v$ of the consecutive edge in multigraph $G$.

Output

Print the minimum number of edges that must be removed from $G$, so that the resulting multigraph is disconnected.

Examples