mod = 10**9+7
n, m = list(map(int,input().split()))
s = list(map(int,input().split()))
t = list(map(int,input().split()))
dp = [[0]*(m+1) for _ in range(n+1)]
for i in range(n)[::-1]:
    for j in range(m)[::-1]:
        if s[i] == t[j]:
            dp[i][j] += 1 + dp[i+1][j+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[0][0]+1)%mod)