Problem:
Score : 400 points

Problem Statement

You are given integers N and M.

Consider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.

Constraints

All values in input are integers.

1 \leq N \leq 10^5

N \leq M \leq 10^9

Input

Input is given from Standard Input in the following format:

N M

Output

Print the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.

Sample Input 1

3 14

Sample Output 1

2

Consider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.

Sample Input 2

10 123

Sample Output 2

3

Sample Input 3

100000 1000000000

Sample Output 3

10000

Solution in Ruby (2.3.3) (judge verdict: Wrong Answer)

#https://abc112.contest.atcoder.jp/tasks/abc112_d

=begin

14/3が可能性のある最大公約数
(N/M)
・N/Mが割り切れた場合
	・N/Mが最大公約数
・割り切れない場合
=end

N,M =gets.split.map(&:to_i)

num = []

for i in 1..Math.sqrt(M).to_i
	if M%i == 0
		num.push(i)
		num.push(M/i)
	end
end

num = num.uniq.sort


previ = 1
for i in num
	if i > M/N
		puts "#{previ}"
		break
	end
	previ = i
end