N, M = map(int, input().split())
S = list(map(int, input().split()))
S.append(-1)
T = list(map(int, input().split()))
T.append(0)
mod = 10 ** 9 + 7
dp0 = [[0] * 2005 for _ in range(2005)]
dp1 = [[0] * 2005 for _ in range(2005)]
dp0[0][0] = 1
for i in range(N + 1):
    for j in range(M + 1):
        dp0[i + 1][j] += dp0[i][j] % mod
        dp1[i][j] += dp0[i][j] % mod
        dp1[i][j + 1] += dp1[i][j] % mod
        if S[i] == T[j]:
            dp0[i + 1][j + 1] += dp1[i][j] % mod
ans = dp1[N][M] % mod
print(ans) N, M = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M S = list(map(int, input().split())) S list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split S.append(-1) S.append S append -1 T = list(map(int, input().split())) T list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split T.append(0) T.append T append 0 mod = 10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 [0] * 2005 for _ in range(2005) for _ in range(2005) _ range(2005) range 2005 for _ in range(2005) [0] * 2005 [0] 0 2005 dp0 = [[0] * 2005 for _ in range(2005)] dp0 [[0] * 2005 for _ in range(2005)] [0] * 2005 for _ in range(2005) for _ in range(2005) _ range(2005) range 2005 for _ in range(2005) [0] * 2005 [0] 0 2005 dp1 = [[0] * 2005 for _ in range(2005)] dp1 [[0] * 2005 for _ in range(2005)] dp0[0][0] = 1 dp0[0][0] [0] dp0 0 0 1 for i in range(N + 1):
    for j in range(M + 1):
        dp0[i + 1][j] += dp0[i][j] % mod
        dp1[i][j] += dp0[i][j] % mod
        dp1[i][j + 1] += dp1[i][j] % mod
        if S[i] == T[j]:
            dp0[i + 1][j + 1] += dp1[i][j] % mod i range(N + 1) range N + 1 N 1 for j in range(M + 1):
        dp0[i + 1][j] += dp0[i][j] % mod
        dp1[i][j] += dp0[i][j] % mod
        dp1[i][j + 1] += dp1[i][j] % mod
        if S[i] == T[j]:
            dp0[i + 1][j + 1] += dp1[i][j] % mod j range(M + 1) range M + 1 M 1 dp0[i + 1][j] += dp0[i][j] % mod dp0[i + 1][j] [i + 1] dp0 i + 1 i 1 j dp0[i][j] % mod dp0[i][j] [i] dp0 i j mod dp1[i][j] += dp0[i][j] % mod dp1[i][j] [i] dp1 i j dp0[i][j] % mod dp0[i][j] [i] dp0 i j mod dp1[i][j + 1] += dp1[i][j] % mod dp1[i][j + 1] [i] dp1 i j + 1 j 1 dp1[i][j] % mod dp1[i][j] [i] dp1 i j mod if S[i] == T[j]:
            dp0[i + 1][j + 1] += dp1[i][j] % mod S[i] == T[j] S[i] S i T[j] T j dp0[i + 1][j + 1] += dp1[i][j] % mod dp0[i + 1][j + 1] [i + 1] dp0 i + 1 i 1 j + 1 j 1 dp1[i][j] % mod dp1[i][j] [i] dp1 i j mod ans = dp1[N][M] % mod ans dp1[N][M] % mod dp1[N][M] [N] dp1 N M mod print(ans) print ans dp1 = [[0] * 2005 for _ in range(2005)] [[0] * 2005 for _ in range(2005)] dp1 ans = dp1[N][M] % mod dp1[N][M] % mod ans M = map(int, input().split()) map(int, input().split()) M S = list(map(int, input().split())) list(map(int, input().split())) S N, M = map(int, input().split()) map(int, input().split()) N T = list(map(int, input().split())) list(map(int, input().split())) T dp0 = [[0] * 2005 for _ in range(2005)] [[0] * 2005 for _ in range(2005)] dp0 mod = 10 ** 9 + 7 10 ** 9 + 7 mod
N, M = map(int, input().split())
S = list(map(int, input().split()))
S.append(-1)
T = list(map(int, input().split()))
T.append(0)
mod = 10 ** 9 + 7
dp0 = [[0] * 2005 for _ in range(2005)]
dp1 = [[0] * 2005 for _ in range(2005)]
dp0[0][0] = 1
for i in range(N + 1):
    for j in range(M + 1):
        dp0[i + 1][j] += dp0[i][j] % mod
        dp1[i][j] += dp0[i][j] % mod
        dp1[i][j + 1] += dp1[i][j] % mod
        if S[i] == T[j]:
            dp0[i + 1][j + 1] += dp1[i][j] % mod
ans = dp1[N][M] % mod
print(ans)