Exhausting Errands

문제

Dolly the delivery drone is out for a busy working day. It has to complete $nn$ errands in a street where $\mathrm{\ell }\backslash ell$ houses are lined up in a row, numbered in ascending order as $1,\dots ,\mathrm{\ell }1,\; \backslash dots,\; \backslash ell$. The distance between adjacent houses is $11$. Each errand consists of picking up a package at some house $aa$ and delivering it to another house $bb$. Dolly can start with any errand, complete the errands in any order, and is able to carry an unlimited number of packages at the same time. Your job is to find the minimal total distance Dolly has to cover to complete all errands. The delivery route can start and finish at arbitrary locations along the street.

Figure E.1: Illustration of Sample Input 1. The shortest route is $2\to 1\to 9\to 42\; \backslash rightarrow\; 1\; \backslash rightarrow\; 9\; \backslash rightarrow\; 4$ with length $1414$.

입력

The input consists of:

• One line with two integers $\mathrm{\ell }\backslash ell$ and $nn$ ($1\le \mathrm{\ell }\le {10}^{9}1\; \backslash le\; \backslash ell\; \backslash le\; 10^9$, $1\le n\le {10}^{5}1\; \backslash le\; n\; \backslash le\; 10^5$), where $\mathrm{\ell }\backslash ell$ is the number of houses in the street, and $nn$ is the number of errands.
• $nn$ lines, each with two integers $aa$ and $bb$ ($1\le a,b\le \mathrm{\ell }1\; \backslash le\; a,\; b\; \backslash le\; \backslash ell$ with $a≠ba\; \backslash not=\; b$) describing an errand where a package must be picked up at house $aa$ and be delivered to house $bb$.

출력

Output a single line with the minimal distance Dolly has to cover from picking up the first package until delivering the last package.