GCD Queries

You are given an array $A$ consisting of $N$ integers along with $Q$ queries. For each query: - $X$ : Given an integer $X$, print and **remove** the **minimum** element in the array $k$, such that $\texttt{gcd} (X, k) \gt 1$, where $\texttt{gcd}$ denotes the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor). If no value present in the array satisfies the condition