Problem: It's been long after the events of the previous problems, and Karen has now moved on from student life and is looking to relocate to a new neighborhood.

<image>

The neighborhood consists of n houses in a straight line, labelled 1 to n from left to right, all an equal distance apart.

Everyone in this neighborhood loves peace and quiet. Because of this, whenever a new person moves into the neighborhood, he or she always chooses the house whose minimum distance to any occupied house is maximized. If there are multiple houses with the maximum possible minimum distance, he or she chooses the leftmost one.

Note that the first person to arrive always moves into house 1.

Karen is the k-th person to enter this neighborhood. If everyone, including herself, follows this rule, which house will she move into?

Input

The first and only line of input contains two integers, n and k (1 ≤ k ≤ n ≤ 1018), describing the number of houses in the neighborhood, and that Karen was the k-th person to move in, respectively.

Output

Output a single integer on a line by itself, the label of the house Karen will move into.

Examples

Input

6 4


Output

2


Input

39 3


Output

20

Note

In the first test case, there are 6 houses in the neighborhood, and Karen is the fourth person to move in:

  1. The first person moves into house 1. 
  2. The second person moves into house 6. 
  3. The third person moves into house 3. 
  4. The fourth person moves into house 2. 



In the second test case, there are 39 houses in the neighborhood, and Karen is the third person to move in:

  1. The first person moves into house 1. 
  2. The second person moves into house 39. 
  3. The third person moves into house 20. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline long long rd() {
  long long x = 0;
  int ch = getchar(), f = 1;
  while (!isdigit(ch) && (ch != '-') && (ch != EOF)) ch = getchar();
  if (ch == '-') {
    f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void rt(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10)
    rt(x / 10), putchar(x % 10 + '0');
  else
    putchar(x + '0');
}
long long n, k;
map<long long, long long> save, now, nxt;
map<long long, long long, greater<long long>> dst;
long long calc(long long len, long long x) {
  if (!len) return 0;
  if (save.count(len)) return save[len];
  long long ret = calc((len - 1) / 2, x) + calc(len - 1 - (len - 1) / 2, x);
  if ((len - 1) / 2 == x) ret++;
  return save[len] = ret;
}
long long find(long long l, long long r, long long x, long long k) {
  if (l > r) return 0;
  long long mid = (l + r) >> 1;
  if (calc(mid - l, x) >= k)
    return find(l, mid - 1, x, k);
  else
    k -= calc(mid - l, x);
  if (mid - l == x) {
    if (k == 1)
      return mid;
    else
      k--;
  }
  return find(mid + 1, r, x, k);
}
long long work(long long n, long long k) {
  if (k == 1) return 1;
  if (k == 2) return n;
  k -= 2;
  now[n - 2] = 1;
  for (;;) {
    nxt.clear();
    for (auto x : now)
      if (x.first) {
        dst[(x.first - 1) / 2] += x.second;
        nxt[(x.first - 1) / 2] += x.second;
        nxt[x.first - 1 - (x.first - 1) / 2] += x.second;
      }
    now = nxt;
    if (now.empty()) break;
  }
  for (auto x : dst) {
    if (k <= x.second)
      return find(2, n - 1, x.first, k);
    else
      k -= x.second;
  }
}
int main() {
  n = rd(), k = rd();
  rt(work(n, k)), putchar('\n');
}