GoLang Solution
\n# Code\n\nimport(\n    "sort"\n    "math"\n    "fmt"\n)\n\nfunc numSubseq(nums []int, target int) int {\n    n, mod :=len(nums), math.Pow(10,9) + 7\n    sort.
\n# Code\n```\nimport(\n    "sort"\n    "math"\n    "fmt"\n)\n\nfunc numSubseq(nums []int, target int) int {\n    n, mod :=len(nums), math.Pow(10,9) + 7\n    sort.Ints(nums)\n\n    var ans float64\n    left, right := 0,n-1\n    power:= make([]float64,n)\n    power[0] = 1\n    for i:=1;i<n;i++{\n        power[i] = math.Mod((power[i-1] * 2),mod)\n    }\n    for left <= right{\n        if nums[left] + nums[right] <=target{\n            ans+=power[right-left]\n            ans = math.Mod(ans,mod)\n            left++\n        }else{\n            right--\n        }\n    }\n    return int(ans)\n\n}\n```
['Go']