For this Question: Solo is playing with numbers from 1 to K. Her small sister Tono comes to her and asks her the following question:
You are given an integer N. You need to create it using the numbers between 1 to K (the numbers you are have), such that you choose multiple instances of <b>only one integer</b>. What are minimum number of instances required to create N?

In simple terms, you need to choose an integer P between 1 to K, such that P * Q = N, and Q is the minimum possible.

Report Q.The first and the only line of input contains two integers N and K.

Constraints
1 <= N <= 1000000000000
1 <= K <= 1000000000000Output a single integer the minimum number of instances required to create N.Sample Input
8 7

Sample Output
2

Explanation
You choose 2 instances of 4.

Sample Input
6 10

Sample Output
1, I have written this Solution Code: import math
n,k=map(int,input().split())
if(k>=n):
	print(1)
elif(k==1):
	print(n)
else:
	ans=n
	for i in range(1,math.ceil(math.sqrt(n))+1):
		if (i)<=k:
			if i*(n//i)==n:
				ans=min(ans,n//i)
	for i in range(math.ceil(math.sqrt(n))+1,0,-1):
		if n//i<=k:
			if i*(n//i)==n:
				ans=min(ans,i)
	print(ans), In this Programming Language: Python, Now tell me if this Code is compilable or not?