{"raw_statement":[{"iden":"problem statement","content":"Given integers $L$ and $L,R\\ (L \\le R)$, find the number of pairs $(x,y)$ of integers satisfying all of the conditions below:\n\n*   $L \\le x,y \\le R$\n*   Let $g$ be the greatest common divisor of $x$ and $y$. Then, the following holds.\n    *   $g \\neq 1$, $\\frac{x}{g} \\neq 1$, and $\\frac{y}{g} \\neq 1$."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\le L \\le R \\le 10^6$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$L$ $R$"},{"iden":"sample input 1","content":"3 7"},{"iden":"sample output 1","content":"2\n\nLet us take some number of pairs of integers, for example.\n\n*   $(x,y)=(4,6)$ satisfies the conditions.\n*   $(x,y)=(7,5)$ has $g=1$ and thus violates the condition.\n*   $(x,y)=(6,3)$ has $\\frac{y}{g}=1$ and thus violates the condition.\n\nThere are two pairs satisfying the conditions: $(x,y)=(4,6),(6,4)$."},{"iden":"sample input 2","content":"4 10"},{"iden":"sample output 2","content":"12"},{"iden":"sample input 3","content":"1 1000000"},{"iden":"sample output 3","content":"392047955148"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}