# Permutation Subsequenc CodeChef Solution

### We Are Discuss About CODECHEF SOLUTION

Permutation Subsequenc CodeChef Solution

## Permutation Subsequenc CodeChef Solution ## Problem

Chefina has an array  consisting of  positive integers.

A permutation subsequence of length  is a subsequence that represents a permutation of length .

Now, Chefina asks Chef to find the count of permutation subsequences in array . The count can be very large, so output it modulo 1000000007 (109+7).

As a reminder:

• A subsequence of an array is obtained by deleting some (possibly zero) elements from the array without changing the order of the remaining elements.
• A permutation of length  is an array of length  in which every element from 1 to  occurs exactly once.

### Input Format

• The first line of input will contain a single integer , denoting the number of test cases.
• Each test case consists of multiple lines of input.
• The first line of each test case contains an integer  — the length of array .
• The next line contains  space-separated integers, the elements of the array .

### Output Format

For each test case, output on a new line, the count of permutation subsequences in array , modulo 109+7.

### Constraints

• 1≤�≤2⋅105
• 1≤�≤2⋅105
• 1≤��≤109
• Sum of  over all test cases does not exceed 2⋅105.

### Sample 1:

Input

Output

2
5
1 2 3 2 4
6
1 3 5 8 9 8

7
1

### Explanation:

Test case 1: Chef can get 7 permutation subsequences:  , [1,2] , [1,2] , [1,2,3] , [1,3,2] , [1,2,3,4] , [1,3,2,4].

Test case 2: Chef can get 1 permutation subsequence: ## SOLUTION

Yhaa You have done it but next? if YOU Want to Get Others Please Visit Here ScishowEngineer   Then Follow US HERE and Join Telegram.