human
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 cin, cout streams or the %I64d specifier.

Output

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

Examples

Input

10 3

Output

5

Input

7 7

Output

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.
Using python3 can you solve the prior task?
 ... Give me a Python code to find out which number will stand at the position number k?
assistant
#Here is Python code to find out which number will stand at the position number k.

# from datetime import datetime
#
#
# def seq(n):
#     count = 1
#     while count <= n:
#         yield count
#         count += 2
#     count = 2
#     while count <= n:
#         yield count
#         count += 2
#
#
# t1 = datetime.now()
# n, k = map(int, input().split())
# nums = seq(n)
# for i in range(k-1):
#     next(nums)
# print(next(nums))
# print(datetime.now() - t1)

n, k = map(int, input().split())
# count_odds = n - n//2
# if k > count_odds:
#     print(2 * (k - count_odds))
# else:
#     print(2 * k - 1)
print([2*(k-(n-n//2)), 2*k-1][k<=n-n//2])