The score of an Array \(S\) of length \(N \) is defined as \(\sum_{i=0}^{N-2} S_i \cdot S_{i+1}\), i.e. sum of product of every consecutive pair of elements.

Given an Array \(arr\) of length \(N\) find the sum of scores of every subsequence of \(arr\) of length atleast \(2\), return the sum modulo \(10^9 + 7\).

A subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements.

Input Format:

• First line contains an integer \(T\) denoting the number of test cases.
• First line of each testcase contains an integer \(N\) denoting length of \(arr\).
• Next line contains \(N \) space-seperated integer, denoting the elements of \(arr\).

Output Format:

• For each testcase, print the sum of scores of every subsequence of \(arr\) having length atleast \(2\), modulo \(10^9 + 7\).

Constraints:

• \(1 \le T \le 10\)
• \(2 \le N \le 5 \times 10^5\)
• \(0 \le arr[i] \le 10^4\)