#P3935. Calculating

Calculating

Problem Description

If the prime factorization of xx is x=p1k1p2k2⋯pnknx=p_1^{k_1}p_2^{k_2}\cdots p_n^{k_n}, define f(x)=(k1+1)(k2+1)⋯(kn+1)f(x)=(k_1+1)(k_2+1)\cdots (k_n+1). Compute ∑i=lrf(i)\sum_{i=l}^r f(i) modulo 998 244 353998\,244\,353.

Input Format

The input contains a single line with two integers, representing ll and rr.

Output Format

Output a single integer on one line representing the answer.

2 4
7

Hint

Constraints and Conventions

Test point ID ll rr r−lr-l
1∼31\sim 3 1≤l≤101\le l\le 10 1≤r≤101\le r\le 10 r−l=0r-l=0
4∼74\sim 7 1≤l≤501\le l\le 50 1≤r≤501\le r\le 50
8∼108\sim 10 1≤l≤1001\le l\le 100 1≤r≤1001\le r\le 100 r−l<50r-l<50
11∼1611\sim 16 1≤l≤5001\le l\le 500 1≤r≤5001\le r\le 500 No special restriction
17∼2517\sim 25 1≤l≤1031\le l \le 10^3 1≤r≤1031\le r \le 10^3
26∼3026\sim 30 1≤l≤5×1031\le l \le 5\times 10^3 1≤r≤5×1031\le r \le 5\times 10^3 r−l<100r-l<100
31∼4031\sim 40 1≤l≤1041\le l \le 10^4 1≤r≤1041\le r \le 10^4 No special restriction
41∼6041\sim 60 1≤l≤1071\le l \le 10^7 1≤r≤1071\le r \le 10^7
61∼7061\sim 70 1≤l≤1091\le l \le 10^9 1≤r≤1091\le r \le 10^9
71∼9071\sim 90 1≤l≤10121\le l \le 10^{12} 1≤r≤10121\le r \le 10^{12}
91∼9591\sim 95 1≤l≤10131\le l \le 10^{13} 1≤r≤10131\le r \le 10^{13}
96∼9796\sim 97 1≤l≤2×10131\le l \le 2\times 10^{13} 1≤r≤2×10131\le r \le 2\times 10^{13} r−l<1013r-l<10^{13}
98∼9998\sim 99 1≤l≤10131\le l \le 10^{13} 1≤r≤10141\le r \le 10^{14} r−l>9×1013r-l>9\times 10^{13}
100100 1≤l≤10141\le l \le 10^{14} 1≤r≤1.6×10141\le r \le 1.6\times 10^{14} r−l>1014r-l>10^{14}

Translated by ChatGPT 5