GCD Queries

You are given an array $arr$ with $n$ integers. You are asked to execute a maximum of $q$ queries of the following kind: print the $GCD$ of the elements in the array located between indices $l$ and $r$ (one-indexed), both inclusive. However, you will not be given $l$ and $r$ for each query. Instead, you will be given 5 integers $l_0$, $r_0$, $k_0$, $k_1$ and $v_0$. For the first query, $l=l_0$, $r