N,M = gets.split.map(&:to_i)
require 'prime'
class Integer
  
    def my_divisor_list
      divisors = [1]
      primes = []
      Prime.prime_division(self).each do |prime|
        prime[1].times {primes << prime[0]}
      end
  
      1.upto(primes.size) do |i|
        primes.combination(i) do |prime|
          divisors << prime.inject{|a,b| a *= b}
        end
      end
  
      divisors.uniq!
      divisors.sort!
      return divisors
    rescue ZeroDivisionError
      return
    end
  end
  puts M.my_divisor_list.find_all{|i|i<=M/N+1}.max
  