output_description: Print the maximum possible value of the greatest common divisor of a sequence
  a_1, a_2, ..., a_N that satisfies the condition.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M
attempt: def divisore(n):
      divisors=[]
      for i in range(1,int(n**0.5)+1):
          if n%i==0:
              divisors.append(i)
              if i!=n//i:
                  divisors.append(n//i)
      divisors.sort(reverse=True)
      return divisors
  
  n,m=map(int,input().split())
  l=divisore(m)
  for i in l:
    if m/n>=i:
    print(i)
    exit()
problem_description: 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.
samples: [{"input": "3 14", "output": "2\n    \n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common\ndivisor is 2, and this is the maximum value.\n\n* * *"}, {"input": "10 123", "output": "3\n    \n\n* * *"}, {"input": "100000 1000000000", "output": "10000"}]