Count Unique Substrings

Given a string \( s \), your task is to compute the number of unique substrings of \( s \) modulo \(10^9+7\). A substring is defined as a contiguous block of characters within the string. For example, for the string "abc", the unique substrings are "a", "b", "c", "ab", "bc", and "abc", making a total of 6. Your solution should read from standard input and write the answer to standard output.

inputFormat

The input consists of a single line containing the string \( s \). The string will only contain lowercase English letters.

outputFormat

Output a single integer, the number of unique substrings of \( s \) modulo \(10^9+7\).

a

1