import sys
input = sys.stdin.buffer.readline
N, M = map(int, input().split())
S = list(map(int, input().split()))
T = list(map(int, input().split()))
mod = 10 ** 9 + 7
dp = [[0] * (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] = (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[-1][-1] + 1) % mod)