#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
  int N, M;
  cin >> N >> M;
  int S[N + 1], T[M + 1];
  for (int i = 1; i <= N; i++) cin >> S[i];
  for (int i = 1; i <= M; i++) cin >> T[i];
  long long dp[N + 1][M + 1];
  for (int i = 0; i < N + 1; i++) dp[i][0] = 0;
  for (int j = 0; j < M + 1; j++) dp[0][j] = 0;
  for (int i = 1; i <= N; i++)
    for (int j = 1; j <= M; j++) {
      if (S[i] == T[j])
        dp[i][j] = (dp[i - 1][j] + dp[i][j - 1] + 1) % MOD;
      else
        dp[i][j] = (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]) % MOD;
    }
  cout << (dp[N][M] + 1) % MOD << endl;
}
