{"problem":{"name":"Coprime Present","description":{"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. Snuke will be happy if,","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc195_f"},"statements":[{"statement_type":"Markdown","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?\n\n## Constraints\n\n*   $1 \\leq A \\leq B \\leq 10^{18}$\n*   $B-A \\leq 72$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$A$ $B$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc195_f","tags":[],"sample_group":[["2 4","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}$"],["1 1","2\n\nThe following two sets of cards will make Snuke happy:\n\n*   ${}$\n*   ${1}$"],["123456789000 123456789050","2125824"]],"created_at":"2026-03-03 11:01:14"}}