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 3 Output: 1
Constraints
1 ≤ a ≤ b ≤ 10^{7}
Explanation
2! is the only factorial which is divisible by 2 and not divisible by 3.
hide comments
Siddharth Singh:
20160720 11:42:07
Came Back And Conquered After 8 months :D <3 

vaibhav138:
20160720 04:11:59
Tricky one :)


Piyush Kumar:
20160609 13:36:48
The concept is fairly simple. I wonder why there are only a handful submissions! 

KD :
20160606 17:48:07
use long long int ........otherwise it will give WA ...AC in 2nd go _ 

Sarthak Munshi:
20160604 10:57:53
@Ruhan can you have a look at my submissions ? Its been 12 WA now . Last edit: 20160615 19:50:36 

Ruhan Habib:
20160531 08:42:32
@sunny59 yes. and consider only i > 0 

rainy jain :
20160520 08:31:10
@Ruhan is your approach different from mine. Id:16948914 Last edit: 20160531 14:16:12 

Shashank Tiwari:
20160415 05:42:56
1. Please make sure that for some cases there is no such 'i' and in such a case print 0.


sri:
20160305 14:47:14
what is the range of i?


mcjoshi:
20160227 06:12:13
OMG! AC in 3rd attempt

Added by:  Ruhan Habib 
Date:  20151105 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU JSMONKEY 
Resource:  Own Problem 