For this Question: You are given two integers, A and B. You want to transform A to B by performing a sequence of operations. You can only perform the following operations:
• Divide A by two, but only if A is even.
• Add one to A.
What is the minimum number of operations you need to transform A into B?The input will be a single line containing two integers A and B.

Constraints
1 <= A, B <= 1000000000On a single line write the minimum number of operations required as an integer.Sample Input
103 27

Sample Output
4

Sample Input
3 8

Sample Output
5

Explanation for first sample:
Transformation: 103 -> 104 -> 52 -> 26 -> 27, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException{



	 BufferedReader rd =new BufferedReader(new InputStreamReader(System.in));
		    String[] num = rd.readLine().split(" ");
		     long n = Long.parseLong(num[0]);
			 long m = Long.parseLong(num[1]);



	   long count = 0;
	   if(n<m){
		   System.out.println(m-n);
	   }else{
	   while(n > 0 && n != m){
















		 if(n%2 == 1){
                n++;
               count++;
           }
            else if(n>m){
               n = n/2;
               count++;
           }else{
               count += m-n;
               n=m;
           }
	   }

	   System.out.println(count);
	   }
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?