class Solution:
    def numSubseq(self, nums: List[int], target: int) -> int:

        #TC: O(n log n) n = len(nums)
        #SC: O(1)

        nums.sort()
        print(nums)

        left = 0
        right = len(nums) - 1

        res = 0

        while(left < right):

            Min = nums[left]
            Max = nums[right]

            Sum = Min + Max

            if Sum <= target:
                count = right - left 
                res = res + 2**count
                left += 1
            else:
                right -= 1

        #left == right
        if nums[left]*2<=target:
            res += 1

        return res % (10**9+7)