Powered Parameters

You are given an array $A$ containing $N$ integers. Count the number of **ordered pairs** $(i, j)$ such that: - $1 \leq i, j \leq N$, and - $A_i^j \leq A_j$ That is, $A_i$ raised to the power $j$ doesn't exceed $A_j$. Note that we're counting ordered pairs, meaning the pair $(1, 2)$ is *different* from the pair $(2, 1)$. ### Input - The first line of input will contain a single integer $T$,