Find All Good Strings

📝 Description

Count strings of length n between s1 and s2 without evil as substring

Input Format

Integer n, strings s1, s2, and evil

Output Format

Count modulo 10^9+7

Constraints

s1.length == s2.length == n

🔍 Sample Input

2
"aa"
"da"
"b"
            

✅ Sample Output

51