#include <bits/stdc++.h>
using namespace std;

int main(){
  int K,N,j=0;
  cin>>K>>N;
  vector<int> A(N);
  for(int &i:A)
    cin>>i;
  for(int i=0;i<N;i++)
    j=max(j,(A.at((i+1)%N)+K-A.at(i))%K);
  cout<<K-j<<endl;
}
### Prompt

Develop a solution in Cpp to the problem described below:

There is a circular pond with a perimeter of K meters, and N houses around them.

The i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.

When traveling between these houses, you can only go around the pond.

Find the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.

Constraints

* 2 \leq K \leq 10^6
* 2 \leq N \leq 2 \times 10^5
* 0 \leq A_1 < ... < A_N < K
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


K N
A_1 A_2 ... A_N


Output

Print the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.

Examples

Input

20 3
5 10 15


Output

10


Input

20 3
0 5 15


Output

10

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;

int main(){
  int K,N,j=0;
  cin>>K>>N;
  vector<int> A(N);
  for(int &i:A)
    cin>>i;
  for(int i=0;i<N;i++)
    j=max(j,(A.at((i+1)%N)+K-A.at(i))%K);
  cout<<K-j<<endl;
}
```