N, M = map(int, input().split())
s_list = list(map(int, input().split()))
t_list = list(map(int, input().split()))
mod = 10 ** 9 + 7
dp = [[0 for _ in range(M + 1)] for _ in range(N + 1)]
for i in range(1, N + 1):
    for j in range(1, M + 1):
        if s_list[i - 1] == t_list[j - 1]:
            dp[i][j] += dp[i - 1][j - 1] + 1
            dp[i][j] %= mod
        dp[i][j] += dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]
        dp[i][j] %= mod
print((dp[N][M] + 1) % mod) N, M = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M s_list = list(map(int, input().split())) s_list list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split t_list = list(map(int, input().split())) t_list list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split mod = 10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 [0 for _ in range(M + 1)] for _ in range(N + 1) for _ in range(N + 1) _ range(N + 1) range N + 1 N 1 for _ in range(N + 1) [0 for _ in range(M + 1)] dp = [[0 for _ in range(M + 1)] for _ in range(N + 1)] dp [[0 for _ in range(M + 1)] for _ in range(N + 1)] for i in range(1, N + 1):
    for j in range(1, M + 1):
        if s_list[i - 1] == t_list[j - 1]:
            dp[i][j] += dp[i - 1][j - 1] + 1
            dp[i][j] %= mod
        dp[i][j] += dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]
        dp[i][j] %= mod i range(1, N + 1) range 1 N + 1 N 1 for j in range(1, M + 1):
        if s_list[i - 1] == t_list[j - 1]:
            dp[i][j] += dp[i - 1][j - 1] + 1
            dp[i][j] %= mod
        dp[i][j] += dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]
        dp[i][j] %= mod j range(1, M + 1) range 1 M + 1 M 1 if s_list[i - 1] == t_list[j - 1]:
            dp[i][j] += dp[i - 1][j - 1] + 1
            dp[i][j] %= mod
         s_list[i - 1] == t_list[j - 1] s_list[i - 1] s_list i - 1 i 1 t_list[j - 1] t_list j - 1 j 1 dp[i][j] += dp[i - 1][j - 1] + 1 dp[i][j] [i] dp i j dp[i - 1][j - 1] + 1 dp[i - 1][j - 1] [i - 1] dp i - 1 i 1 j - 1 j 1 1 dp[i][j] %= mod dp[i][j] [i] dp i j mod dp[i][j] += dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] dp[i][j] [i] dp i j dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] dp[i - 1][j] + dp[i][j - 1] dp[i - 1][j] [i - 1] dp i - 1 i 1 j dp[i][j - 1] [i] dp i j - 1 j 1 dp[i - 1][j - 1] [i - 1] dp i - 1 i 1 j - 1 j 1 dp[i][j] %= mod dp[i][j] [i] dp i j mod print((dp[N][M] + 1) % mod) print (dp[N][M] + 1) % mod dp[N][M] + 1 dp[N][M] [N] dp N M 1 mod s_list = list(map(int, input().split())) list(map(int, input().split())) s_list mod = 10 ** 9 + 7 10 ** 9 + 7 mod N, M = map(int, input().split()) map(int, input().split()) N M = map(int, input().split()) map(int, input().split()) M t_list = list(map(int, input().split())) list(map(int, input().split())) t_list dp = [[0 for _ in range(M + 1)] for _ in range(N + 1)] [[0 for _ in range(M + 1)] for _ in range(N + 1)] dp
N, M = map(int, input().split())
s_list = list(map(int, input().split()))
t_list = list(map(int, input().split()))
mod = 10 ** 9 + 7
dp = [[0 for _ in range(M + 1)] for _ in range(N + 1)]
for i in range(1, N + 1):
    for j in range(1, M + 1):
        if s_list[i - 1] == t_list[j - 1]:
            dp[i][j] += dp[i - 1][j - 1] + 1
            dp[i][j] %= mod
        dp[i][j] += dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]
        dp[i][j] %= mod
print((dp[N][M] + 1) % mod)
