We have an array of * N* integers and

*queries. In each query, we are given an integer*

**Q***. For each query, we have to output the number of unordered pairs in array that sum to*

**X***.*

**X**How can we efficiently answer these sort of queries?

Constraints:

1 <= * N* <= 2 * 10

^{5}

1 <= * Q* <= 2 * 10

^{5}

1 <= |a_{i}| <= 10^{18}

1 <= * X* <= 10

^{18}