第一题dp T = int(input()) def solve(x,y): m,n = len(x), len(y) dp = [[0]*(n+1) for _ in range(m+1)] for i in range(m+1): dp[i][0]=1 for i in range(1,m+1): for j in range(1,n+1): if x[i-1] == y[j-1]: dp[i][j] = dp[i-1][j-1]+dp[i-1][j] else: dp[i][j] = dp[i-1][j] return dp[m][n]%int(1e9+7) for _ in range(T): s=input().strip() print(solve(s,"swr"))