#include <bits/stdc++.h>
using namespace std;
int dp[3000][3000] = {0};
int main() {
  int n, m;
  cin >> n >> m;
  vector<int> s(n + 1), t(m + 1);
  for (int i = 0; i < n; ++i) {
    cin >> s[i + 1];
  }
  for (int i = 0; i < m; ++i) {
    cin >> t[i + 1];
  }
  long long ans = 1;
  for (int i = 0; i < 3000; ++i) {
    dp[0][i] = dp[i][0] = 1;
  }
  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]) % 1000000007;
      } else {
        dp[i][j] =
            (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]) % 1000000007;
      }
    }
  }
  cout << dp[n][m] << endl;
  return 0;
}
