本网站所有文字及图片内容均来自网络，每周定时更新，仅供个人学习与研究，请勿用于商业用途。谢谢合作。

Given an array of integers `nums`

and an integer `target`

.

Return the number of **non-empty** subsequences of `nums`

such that the sum of the minimum and maximum element on it is less or equal than `target`

.

Since the answer may be too large, return it modulo 10^9 + 7.

**Example 1:**

Input:nums = [3,5,6,7], target = 9Output:4Explanation:There are 4 subsequences that satisfy the condition. [3] -> Min value + max value <= target (3 + 3 <= 9) [3,5] -> (3 + 5 <= 9) [3,5,6] -> (3 + 6 <= 9) [3,6] -> (3 + 6 <= 9)

**Example 2:**

Input:nums = [3,3,6,8], target = 10Output:6Explanation:There are 6 subsequences that satisfy the condition. (nums can have repeated numbers). [3] , [3] , [3,3], [3,6] , [3,6] , [3,3,6]

**Example 3:**

Input:nums = [2,3,3,4,6,7], target = 12Output:61Explanation:There are 63 non-empty subsequences, two of them don't satisfy the condition ([6,7], [7]). Number of valid subsequences (63 - 2 = 61).

**Example 4:**

Input:nums = [5,2,4,1,7,6,8], target = 16Output:127Explanation:All non-empty subset satisfy the condition (2^7 - 1) = 127

**Constraints:**

`1 <= nums.length <= 10^5`

`1 <= nums[i] <= 10^6`

`1 <= target <= 10^6`