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