ETFS  Euler Totient Function Sieve
In number theory, the totient phi(n) of a positive integer n is defined to be the number of positive integers less than or equal to n that are coprime to n.
Input
The lonely line in input contains two integers a, b.
Output
Print phi(n) for n from a to b (inclusive).
Example
Input: 1 5 Output: 1 1 2 2 4
Constraints
0 < a < b < 10^14 b  a < 10^5
Python can get AC under half the time limit (for any test case). My total PY3.4 time is 3.23s for 5 input files.
Have fun ;)
hide comments
crazy_8:
20231229 16:41:57
here is my code. I am getting the wrong ans on test case 4. Please help me to solve this


samun_49:
20230828 08:02:19
A really fun problem yet a little frustrating. But really good problem for understanding and applying Segmented Sieve on ETF. I really enjoyed myself. Thanks a lot.


vikas12:
20200417 23:03:54
i am also gettin wa for4 th testcase


rjsingh_123:
20200414 17:55:10
Getting wrong answer on case 4


sanjiuchiha:
20200413 15:10:19
I am getting wrong answer on test case 4. I have checked my code multiple times. Can somebody give me a hint.


i_0__0_i:
20200411 10:41:45
99999999899998 99999999999999 isn't this is a valid test case?


zihadboss:
20200322 23:22:58
Give me hint to solve the problem.


ashik_01:
20190808 19:52:13
Just a superb problem. Learned something new. Thanks to the author. 

abhinav_jain02:
20181219 13:33:51
I am getting wrong answer on test case 4. I have checked my code multiple times. Can somebody give me a hint.


eagleshadow:
20181003 16:23:00
Very nice Problem

Added by:  Francky 
Date:  20141229 
Time limit:  2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  ETF 