Given a string `s`

, count the number of distinct, non-empty subsequences of `s`

.

Since the result may be large, **return the answer modulo **`10`

.^{9} + 7

**Example 1:**

Input:s = "abc"Output:7Explanation: The 7 distinct subsequences are "a", "b", "c", "ab", "ac", "bc", and "abc".

**Example 2:**

Input:s = "aba"Output:6Explanation: The 6 distinct subsequences are "a", "b", "ab", "ba", "aa" and "aba".

**Example 3:**

Input:s = "aaa"Output:3Explanation: The 3 distinct subsequences are "a", "aa" and "aaa".

**Note:**

`s`

contains only lowercase letters.`1 <= s.length <= 2000`

class Solution {
public int distinctSubseqII(String s) {
}
}