## 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.

### Input

One line that contains a and b.

### Output

Output the result in one line.

### Example

Input:2 3Output:1

### Constraints

1 ≤ a ≤ b ≤ 10^{7}

### Explanation

2! is the only factorial which is divisible by 2 and not divisible by 3.

Added by: | Ruhan Habib |

Date: | 2015-11-05 |

Time limit: | 1s |

Source limit: | 50000B |

Memory limit: | 1536MB |

Cluster: | Cube (Intel G860) |

Languages: | All except: ASM64 GOSU JS-MONKEY |

Resource: | Own Problem |