S, T = input().split()

# dp[i][j] := Sのi文字目まで見て、Tのj文字目まで一致しているようなものの個数
dp = [[0]*(len(T)+1) for _ in range(len(S)+1)]
dp[0][0] = 1

mod = 998244353
for i in range(len(S)):
    for j in range(len(T)+1):
        dp[i+1][j] += dp[i][j]
        dp[i+1][j] %= mod
        if j < len(T) and S[i] == T[j]:
            dp[i+1][j+1] += dp[i][j]
            dp[i+1][j+1] %= mod

print(dp[len(S)][len(T)] * (1<<len(S)-len(T)) % mod)