## Algorithm

A. Even Odds
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Being a nonconformist, Volodya is displeased with the current state of things, particularly with the order of natural numbers (natural number is positive integer number). He is determined to rearrange them. But there are too many natural numbers, so Volodya decided to start with the first n. He writes down the following sequence of numbers: firstly all odd integers from 1 to n (in ascending order), then all even integers from 1 to n (also in ascending order). Help our hero to find out which number will stand at the position number k.

Input

The only line of input contains integers n and k (1 ≤ k ≤ n ≤ 1012).

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

Output

Print the number that will stand at the position number k after Volodya's manipulations.

Examples
input
Copy
`10 3`
output
Copy
`5`
input
Copy
`7 7`
output
Copy
`6`
Note

In the first sample Volodya's sequence will look like this: {1, 3, 5, 7, 9, 2, 4, 6, 8, 10}. The third place in the sequence is therefore occupied by the number 5.

## Code Examples

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

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

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

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

unsigned long long n, m;
cin>>n>>m;
if(n & 1){
(m <= (n/2 + 1)) ? cout<<(2 * m - 1)<<endl : cout<<(2*(m - (n/2 + 1)))<<endl;
return 0;
}
(m <= n/2) ? cout<<(2 * m - 1)<<endl : cout<<(2*(m - n/2))<<endl;
return 0;
}``````
Copy The Code &

Input

cmd
10 3

Output

cmd
5
Advertisements

## Demonstration

Codeforcess Solution 318-A A. Even Odds ,C++, Java, Js and Python ,318-A,Codeforcess Solution