For this Question: Given an integer N and an integer K, Your task is to multiply the first leftmost digit of the number to the number itself. You have to repeat this process K times.
For eg:- if N=3 and K=5 then:
3 * 3 = 9
9 * 9 = 81
81 * 8 = 648
648 * 6 = 3888
3888 * 3 = 11664<b>User Task:</b>
Complete the function <b>KOperations()</b> that takes the integer N as parameter.

<b>Constraints:</b>
1 <= N <= 100
1 <= K <= 10^9Return the Number after K operations

<b>Note:</b> It is guaranteed that the output will always be less than 10^17.Sample Input:-
3 5

Sample Output:-
11664

Explanation:- See problem statement for explanation.

Sample Input:-
22 2

Sample Output:-
176, I have written this Solution Code: import math 



def KOperations(N,K) : 
      
    # Final result of summation of divisors 
    
    while K>0 :
        p=N
        while(p>=10):
            p=p/10
        
        if(int(p)==1):
            return N;
        N=N*int(p)
        K=K-1
    return N;
      
    
    
   
# Driver program to run the case 
x,y= map(int,input().split());
print (int(KOperations(x,y))) , In this Programming Language: Python, Now tell me if this Code is compilable or not?