D. Unusual Sequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCount the number of distinct sequences a1, a2, ..., an (1 ≤ ai) consisting of positive integers such that gcd(a1, a2, ..., an) = x and . As this number could be large, print the answer modulo 109 + 7.gcd here means the greatest common divisor.InputThe only line contains two positive integers x and y (1 ≤ x, y ≤ 109).OutputPrint the number of such sequences modulo 109 + 7.ExamplesInput3 9Output3Input5 8Output0NoteThere are three suitable sequences in the first test: (3, 3, 3), (3, 6), (6, 3).There are no suitable sequences in the second test.
Input3 9
Output3
['bitmasks', 'combinatorics', 'dp', 'math', 'number theory', '*2000']