import math
s = input()
a, b = s.split(" ")
a = int(a)
b = int(b)
r = 0
if b <= math.ceil(a / 2):
print(1 + 2 * (b - 1))
else:
print(2 * (b - math.ceil(a / 2)))#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<vector>
#include<string>
#include<set>
using namespace std;
typedef long long ll;
typedef bool bl;
typedef double d;
#define fo(a, b, n) for(int a = 0 ;a < n;a++)
int main()
{
ll n, k, c;
cin >> n >> k;
vector<int > v;
if (n % 2 == 0)
c = n / 2;
else
c = (n / 2) + 1;
if (k <= c)
cout << (2 * k - 1);
else
{
if (n % 2 != 0)
{
ll z = n - k;
cout << k - z - 1;
}
else
{
ll z = n - k;
cout << k - z;
}
}
system("pause");
return 0;
}
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |