SP25584 FCDC - Factorial Modulo

Description

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.

Input Format

One line that contains a and b.

Output Format

Output the result in one line.