Correct Position

You are given an integer array $A$ of size $N$. The elements of the array are as follows: $1, 2, 3, ..., N$. Now for each valid index $i$ of the array, find out the number of permutations of $A$ such that all elements that are smaller than $A_i$ are present before $i$ and all elements that are greater than $A_i$ are present after $i$. Note that you are not supposed to change the $i^{th}$ index