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