{"raw_statement":[{"iden":"problem statement","content":"You are given integers $N$ and $M$.\nConsider 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$."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq N \\leq 10^5$\n*   $N \\leq M \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $M$"},{"iden":"sample input 1","content":"3 14"},{"iden":"sample output 1","content":"2\n\nConsider the sequence $(a_1, a_2, a_3) = (2, 4, 8)$. Their greatest common divisor is $2$, and this is the maximum value."},{"iden":"sample input 2","content":"10 123"},{"iden":"sample output 2","content":"3"},{"iden":"sample input 3","content":"100000 1000000000"},{"iden":"sample output 3","content":"10000"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}