You have an array A of N integers A₁,A₂...A_N.
startP and endP are 2 integers defined in array partition P, which
consists all the elements lying at positions [startP,startP+1...endP].
That is, partition P refers to subarray [AstartP,AstartP+1...AendP]
such that startP≤endP.
The value of partition is defined as maximum element present in the partition i.e. value(P)=maximum(AstartP,AstartP+1...AendP).

You have to find the total number of ways to divide array A into
sequence of partitions such that each element of A belongs to exactly one partition and value of each partition is not less than the value of next partition.

Formally, Suppose you divided array A into k partitions P₁,P₂...P_k for
some k≥1, then following conditions should be met:

1.  startP1=1 and endPk=N.
2.  startPi≤endPi for all i≤k.
3.  startPi+1=endPi+1 for all i<k.
4.  value(Pi)≥value(Pi+1) for all i<k.

You have to find out total number of ways to divide array A into such sequence of partitions.

INPUT:

• First line of input consists of integer T denoting total number of testcases.
• First line of each test case consists of an integer N. Next line consists of N integers A₁,A₂...A_N.

Output:

• Output the total number of ways to divide the given array into partitions. Since output can be large, print the total number of ways modulus 10⁹+7.

Constraints:
1≤T≤20
1≤N≤10⁵
1≤A_i≤10⁵