Slow Solution

Chef is trying to solve a problem having $T$ test cases, where, for each test case he is given a single integer $N$. Chef has an algorithm which takes **exactly** $N^2$ iterations for a test case with value $N$. The constraints of the problem are as follows: - $1 \leq T \leq maxT$ - $1 \leq N \leq maxN$ - Sum of $N$ over all test cases does not exceed $sumN$. Given the values $maxT, maxN,$ and