Number of Subsequences That Satisfy the Given Sum Condition

Statement

Given an integer array nums and an integer target, count how many non empty subsequences of nums satisfy the following condition: if minVal is the minimum element in the subsequence and maxVal is the maximum element in the subsequence, then minVal + maxVal <= target.

Return the number of such subsequences modulo $10^9 + 7$ ...