#486 Easy Divisor Problem

Statement

Statement language

For a positive integer $x$ , let $\tau(x)$ denote the number of positive divisors of $x$ .

You are given a positive integer $N$ . Compute

D(N)=\sum_{x=1}^{N}\tau(x).

The value can be very large, so print $D(N)$ modulo $998\,244\,353$ .

The input is given from Standard Input in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$

For each test case, print the remainder of $D(N)$ modulo $998\,244\,353$ on one line.

#	Score	Constraints
1	5	$N \leq 10^6$ .
2	15	$N \leq 10^{12}$ .

Input

Output