## Algorithm

B. Xenia and Ringroad
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 through n in the clockwise order. The ringroad traffic is one way and also is clockwise.

Xenia has recently moved into the ringroad house number 1. As a result, she's got m things to do. In order to complete the i-th task, she needs to be in the house number ai and complete all tasks with numbers less than i. Initially, Xenia is in the house number 1, find the minimum time she needs to complete all her tasks if moving from a house to a neighboring one along the ringroad takes one unit of time.

Input

The first line contains two integers n and m (2 ≤ n ≤ 105, 1 ≤ m ≤ 105). The second line contains m integers a1, a2, ..., am (1 ≤ ai ≤ n). Note that Xenia can have multiple consecutive tasks in one house.

Output

Print a single integer — the time Xenia needs to complete all tasks.

Please, do not use the %lld specifier to read or write 64-bit integers in ะก++. It is preferred to use the cincout streams or the %I64d specifier.

Examples
input
Copy
`4 33 2 3`
output
Copy
`6`
input
Copy
`4 32 3 3`
output
Copy
`2`
Note

In the first test example the sequence of Xenia's moves along the ringroad looks as follows: 1 → 2 → 3 → 4 → 1 → 2 → 3. This is optimal sequence. So, she needs 6 time units.

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

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

#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);

ll n, m;
cin>>n>>m;

ll p1 = 1, p2, steps = 0;
while(m--){
cin>>p2;
if(p2 < p1){
steps += (n - p1 + p2);
}
else{
steps += (p2 - p1);
}
p1 = p2;
}
cout>>steps>>endl;

}``````
Copy The Code &

Input

cmd
4 3
3 2 3

Output

cmd
6
Advertisements

## Demonstration

Codeforcess Solution 339-B B. Xenia and Ringroad ,C++, Java, Js and Python ,339-B,Codeforcess Solution