Alice and Bob are playing a game with a fixed array and a dynamic array. In one round, Alice can remove an element $$$y$$$ from the dynamic array if $$$y \% fixed[i] = 0$$$ for some $$$i$$$. And Bob can remove this element if $$$y \% fixed[i] \neq 0$$$. The first player to run out of moves loses. Find out who the winner is.

I created a video on this interesting problem that intersects with game theory and number theory.

https://youtu.be/rlrHg6nJxMI