Counting Tuples

You are given an integer $N$. You have to count the number of distinct tuples $(A, B, C, D)$ with $1 \leq A, B, C, D \leq N$ such that $A \cdot B = C \cdot D$. Two tuples, say $(A, B, C, D)$ and $(E, F, G, H)$ are considered to be different if **at least** one of the following conditions hold true: - $A \neq E$ - $B \neq F$ - $C \neq G$ - $D \neq H$. ### Input - First line will contain $T$, n