Suppose we have a sequence of n blocks. Then we paint the blocks. Each block should be painted a single color and block i can have color 1 to color ai. So there are a total of prod(ai) different ways to color the blocks. Consider one way to color the blocks. We call a consecutive sequence of blocks with the same color a "piece". For example, sequence "Yellow Yellow Red" has two pieces and sequence "Yellow Red Blue Blue Yellow" has four pieces. What is S, the total number of pieces of all possible ways to color the blocks?
This is not your task. Your task is to permute the blocks (together with its corresponding ai) so that S is maximized.
输入解释
First line, number of test cases, T. Following are 2*T lines. For every two lines, the first line is n, length of sequence; the second line contains n numbers, a1, ..., an.
Sum of all n <= 106. All numbers in the input are positive integers no larger than 109.
输出解释
Output contains T lines. Each line contains one number, the answer to the corresponding test case. Since the answers can be very large, you should output them modulo 109+7.
输入样例
1
3
1 2 3
输出样例
14
提示
Both sequence 1 3 2 and sequence 2 3 1 result in an S of 14.