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