You are given $4$ positive integers $N$, $a$, $b$, and $c$. 
Your task is to calculate the total number of integers from $1$ to $N$ that are divisible by either $a$, $b$, or $c$.

Input Format

• The first line of the input data contains the single integer $T$ denoting the number of test cases.
•  Each test case contains four integers $N$, $a$, $b$ and $c$.

Output Format:

• For each test case output the total number of intergers from $1$ to $N$ which are divisible by either $a$, $b$ or $c$.

Constraints

• $1 \leq T \leq 100$
• $1 \leq N \leq 10^9$
• $1 \leq a,b,c \leq N$