dsddsdsda

package com.Tasks;

import java.util.ArrayList;
import java.util.Scanner;

public class Task2 {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        String[] arr = scanner.nextLine().split(" ");
        int k = Integer.parseInt(arr[0]);
        int n = Integer.parseInt(arr[1]);
        ArrayList<Integer> nums = new ArrayList<>();
        nums.add(k);

        recursion(k, nums, n);



    public static void recursion(int k, ArrayList<Integer> nums, int n){
        nums.add(k+1);
        nums.add(2*k+1);
        nums.add(k+2);
        if(nums.size()>=n){
            System.out.println(nums.get(n-1));
            return;
        } else recursion(nums.get((nums.size()-1)/3), nums, n);
    }
}