CF475D.CGCDSSQ

Given a sequence of integers $a_{1},...,a_{n}$ and $q$ queries $x_{1},...,x_{q}$ on it. For each query $x_{i}$ you have to count the number of pairs $(l,r)$ such that $1<=l<=r<=n$ and $gcd(a_{l},a_{l+1},...,a_{r})=x_{i}$ .

is a greatest common divisor of $v_{1},v_{2},...,v_{n}$ , that is equal to a largest positive integer that divides all $v_{i}$ .

Given a sequence of integers $a_{1},...,a_{n}$ and $q$ queries $x_{1},...,x_{q}$ on it. For each query $x_{i}$ you have to count the number of pairs $(l,r)$ such that $1<=l<=r<=n$ and $gcd(a_{l},a_{l+1},...,a_{r})=x_{i}$ .

is a greatest common divisor of $v_{1},v_{2},...,v_{n}$ , that is equal to a largest positive integer that divides all $v_{i}$ .

For each query print the result in a separate line.