Prime Range Game

You are given positive integers $L$ and $R$, and a [prime number](https://en.wikipedia.org/wiki/Prime_number) $P$. Consider an array $A = [L, L+1, \ldots, R-1, R]$ of size $(R-L+1)$. Two players are playing a game on the array $A$. The player with the turn will: - Choose an index $1 \le i \le (R-L+1)$ and a **positive** integer $X$ such that $A_i$ is divisible by $P^X$. - Divide $A_i$ by $P^X$