You are given an array $A$ of size $N$. You are also given two integers $X$ and $Y$. Your task is to find the count of subarrays whose least common multiple (LCM) value is between $X$ and $Y$ (inclusive).

The subarray of $A$ is a contiguous part of the array $A$, i. e. the array $A_i, A_{i + 1}, ...., A_j$ for some $1 \leq i \leq j \leq N$.

 Input Format:

• The first line contains a single integer $T$, which denotes the number of test cases.
• For each test case:
  • The first line contains denoting the size of the array $A$.
  • The second line contains $N$ space-separated integers, denoting the elements of $A$.
  • The third line contains $2$ space-separated integers, denoting the values $X$ and $Y$.

Output Format:

For each test case, print the count of subarrays within the given array such that the least common multiple (LCM) of all elements in the subarray is between $X$ and $Y$ (inclusive) in a new line.

Constraints:

$1 \leq T \leq 10^5 \\ 1 \leq N \leq 2×10^5 \\1≤A[i]≤10^9\ ∀\ i∈[1,N] \\ 1≤X≤Y≤10^9\\ \text{The sum of all values of N over all test cases doesn't exceed } 2×10^5$