Divisible Subarray Counting

An array $B$ of length $M$ is called *good* if, when it is sorted, $B_i$ divides $B_{i+1}$ for every $1 \leq i \lt M$. For example, $[1, 2, 1]$, $[66, 6, 3]$, and $[4, 4]$ are good arrays, while $[1, 2, 3]$ and $[99, 6, 3]$ are not. You're given an array $A$ containing $N$ integers. Answer $Q$ queries of the following form: - Given $L$ and $R$, let $B$ be the subarray of $A$ from index $L$ to i