GCD Arrays (Easy)

**This is the easy version of the problem. In this version, $M \le 100$.** An array $A$ of length $N$ is called good if it satisfies the following conditions: - $\gcd(A_1, A_2, \ldots, A_N) = 1$ - $\gcd(A_L, A_{L + 1}, \ldots, A_R) \ne 1$ for all $(L, R) \ne (1, N)$ That is, every other subsegment except the full array should have gcd not $1$. Given integers $N$ and $M$, count the number of go