FCDC - Factorial Modulo
You are given 2 integers a, b. Find the number of i for which i! is divisble by a but not b. if i! is divisible by a and b, then you should not count that i.
One line that contains a and b.
Output the result in one line.
Input: 2 3 Output: 1
1 ≤ a ≤ b ≤ 107
2! is the only factorial which is divisible by 2 and not divisible by 3.