def solve():
    N, M = map(int, input().split())
    S = list(map(int, input().split()))
    T = list(map(int, input().split()))
    MOD = 10 ** 9 + 7
    
    dp = [[1] * (M + 1) for _ in range(N + 1)]
    for i in range(N):
        for j in range(M):
            if S[i] == T[j]:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1]) % MOD
            else:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % MOD
    print(dp[N][M])


if __name__ == '__main__':
    solve() def solve():
    N, M = map(int, input().split())
    S = list(map(int, input().split()))
    T = list(map(int, input().split()))
    MOD = 10 ** 9 + 7
    
    dp = [[1] * (M + 1) for _ in range(N + 1)]
    for i in range(N):
        for j in range(M):
            if S[i] == T[j]:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1]) % MOD
            else:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % MOD
    print(dp[N][M]) solve 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 T = list(map(int, input().split())) T 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 [1] * (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) [1] * (M + 1) [1] 1 M + 1 M 1 dp = [[1] * (M + 1) for _ in range(N + 1)] dp [[1] * (M + 1) for _ in range(N + 1)] for i in range(N):
        for j in range(M):
            if S[i] == T[j]:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1]) % MOD
            else:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % MOD
     i range(N) range N for j in range(M):
            if S[i] == T[j]:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1]) % MOD
            else:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % MOD
     j range(M) range M if S[i] == T[j]:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1]) % MOD
            else:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % MOD
     S[i] == T[j] S[i] S i T[j] T j dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1]) % MOD dp[i + 1][j + 1] [i + 1] dp i + 1 i 1 j + 1 j 1 (dp[i + 1][j] + dp[i][j + 1]) % MOD 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 MOD dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % MOD dp[i + 1][j + 1] [i + 1] dp i + 1 i 1 j + 1 j 1 (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % MOD dp[i + 1][j] + dp[i][j + 1] - dp[i][j] 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][j] [i] dp i j MOD print(dp[N][M]) print dp[N][M] [N] dp N M if __name__ == '__main__':
    solve() __name__ == '__main__' __name__ '__main__' solve() solve def solve():
    N, M = map(int, input().split())
    S = list(map(int, input().split()))
    T = list(map(int, input().split()))
    MOD = 10 ** 9 + 7
    
    dp = [[1] * (M + 1) for _ in range(N + 1)]
    for i in range(N):
        for j in range(M):
            if S[i] == T[j]:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1]) % MOD
            else:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % MOD
    print(dp[N][M]) def solve():
    N, M = map(int, input().split())
    S = list(map(int, input().split()))
    T = list(map(int, input().split()))
    MOD = 10 ** 9 + 7
    
    dp = [[1] * (M + 1) for _ in range(N + 1)]
    for i in range(N):
        for j in range(M):
            if S[i] == T[j]:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1]) % MOD
            else:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % MOD
    print(dp[N][M]) solve
def solve():
    N, M = map(int, input().split())
    S = list(map(int, input().split()))
    T = list(map(int, input().split()))
    MOD = 10 ** 9 + 7
    
    dp = [[1] * (M + 1) for _ in range(N + 1)]
    for i in range(N):
        for j in range(M):
            if S[i] == T[j]:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1]) % MOD
            else:
                dp[i + 1][j + 1] = (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % MOD
    print(dp[N][M])


if __name__ == '__main__':
    solve()
