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