{"raw_statement":[{"iden":"problem statement","content":"You have $B-A+1$ cards: for each integer from $A$ through $B$, you have one card with that integer written on it. You will give some of them (possibly none) to your pet, Snuke.\nSnuke will be happy if, for every pair of different cards, the numbers written on them are pairwise coprime; otherwise, he will be sad.\nHow many sets of cards will make Snuke happy?"},{"iden":"constraints","content":"*   $1 \\leq A \\leq B \\leq 10^{18}$\n*   $B-A \\leq 72$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$A$ $B$"},{"iden":"sample input 1","content":"2 4"},{"iden":"sample output 1","content":"6\n\nYou have three cards with $2$, $3$, and $4$ written on them. The following six sets of cards will make Snuke happy:\n\n*   ${}$\n*   ${2}$\n*   ${3}$\n*   ${4}$\n*   ${2,3}$\n*   ${3,4}$"},{"iden":"sample input 2","content":"1 1"},{"iden":"sample output 2","content":"2\n\nThe following two sets of cards will make Snuke happy:\n\n*   ${}$\n*   ${1}$"},{"iden":"sample input 3","content":"123456789000 123456789050"},{"iden":"sample output 3","content":"2125824"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}