Count Winning Subarrays

We call a binary array $B$ of size $M$ **winning** if it can be converted to the array $[1, 1, \ldots, 1]$ by repeating the following operation a finite number of times: - Pick $1 \le L \le R \le M$ such that the number of $1$'s in the subarray $B[L, R]$ is **strictly greater** than the number of $0$'s in it. Then, replace $B_i$ with $1$ for all $L \le i \le R$. Given an array $A$ of size $N$