Count Subarrays

You are given a permutation $P$ of length $N$. For each $1\le i \le N$, find the number of subarrays of $P$ with sum $i$. Note that a permutation of length $N$ consists of all integers from $1$ to $N$ exactly once. ### Input - The first line contains a single integer $T$, denoting the number of test cases. - The first line of each test case contains a positive integer $N$ $-$ the length of $P$