def find_last_position(N, K):
    left = K - 1
    right = N - K
    left_steps = 0
    right_steps = 0
    total_steps = N - 1  # number of cars to park after the first

    while total_steps > 0:
        if left > right:
            take = min(total_steps, left - right)
            left_steps += take
            left -= take
            total_steps -= take
        elif right > left:
            take = min(total_steps, right - left)
            right_steps += take
            right -= take
            total_steps -= take
        else:
            pairs = total_steps // 2
            left_steps += pairs
            right_steps += pairs
            left -= pairs
            right -= pairs
            total_steps -= 2 * pairs
            if total_steps > 0:
                left_steps += 1
                left -= 1
                total_steps -= 1

    if right_steps > left_steps:
        return N - (right_steps - 1)
    elif left_steps > right_steps:
        return left_steps
    else:
        return K - left_steps if left > right else K + right_steps

# Read input
N, K = map(int, input().split())
print(find_last_position(N, K))