
mod=10**9+7



n,m =map(int, input().split())
s=[0]+ list(map(int, input().split()))
t=[0]+ list(map(int, input().split()))

dp=[([0]*(m+1)) for i in range(n+1)]

for i in range(1,n+1):
    for j in range(1,m+1):
        dp[i][j]=(dp[i-1][j]+dp[i][j-1])%mod
        if s[i]==t[j]:
            dp[i][j]=(dp[i][j]+1)%mod
        else:
            dp[i][j]=(dp[i][j]-dp[i-1][j-1]+mod)%mod

print((dp[n][m]+1)%mod)



