CareerCup

"Good Range"

There is a number space given from 1 to N. And there are M queries followed by that. In each query, we were given a number between 1 to N (both inclusive). We add these number one by one into a set.

Good range: A range in which there is exactly one element present from the set.

For each query, we need to find the good ranges. We need to return the sum of boundry of all good ranges.

Input:
First line will take two integer for input N and M.
Then following M lines would be numbers between 1 and N (both inclusive).

Output:
Following M lines contains sum of boudaries of good ranges.

Note:
Range can consist of single element and represented as (x-x) where boundary sum will be x+x.

Example:

Input:
10 4
2
5
7
9

Output:
11
18
30
46

Explaination:
step-1) set: 2
good range: (1-10)
sum: 1+10=11

step-2) set: 2 5
good range: (1-4), (3-10)
sum: 1+4+3+10=18

step-3) set: 2 5 7
good range: (1-4), (3-6), (6-10)
sum: 1+4+3+6+6+10=30

step-4) set: 2 5 7 9
good range: (1-4), (3-6), (6-8), (8-10)
sum: 1+4+3+6+6+8+8+10=46