You are given an array $$A$$ that consists of $$N$$ elements.
Assume that a function \(F(x) = (x\:mod\:A_1) + (x\:mod\:A_2)\:+\: ..... \:+\:(x\:mod\:A_N)\), for some non-negative integer $$x$$. You are required to find the maximum possible value of the function $$F(x)$$.

Here, \(X\:mod\:Y\) denotes the remainder of the $$X$$ division by $$Y$$.

Input format

The first line contains an integer $$T$$ denoting the number of test cases.
The first line of each test case contains an integer $$N$$ denoting the size of array $$A$$.
The second line of each test case contains $$N$$ space-separated integers denoting array $$A$$.

Output format

For each test case, print the maximum possible value of $$F(x)$$ in a new line.

Constraints

\(1 \le T \le 1000\\ 1 \le N \le 200000\\ 1 \le A_i \le 1000000000\)

It is guaranteed that the sum of $$N$$ over $$T$$ test cases does not exceed $$1e6$$.