Indivisible

Harsh recieved $3$ numbers on his birthday $N, x, y$. Now he wants to find sum of all distinct numbers between $[1, N]$ which is neither divisible by $x$ nor by $y.$ ### Input You are given $T$ testcases and each testcase contains $1$ line with $3$ numbers$,$ $N, x, y$. - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of