#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));
  dp[0][0] = 1;
  for (int i = 0; i < n + 1; ++i) {
    for (int j = 0; j < m + 1; ++j) {
      if (i > 0 && j > 0 && s[i - 1] == t[j - 1]) dp[i][j] += dp[i - 1][j - 1];
      if (i > 0 && j > 0) dp[i][j] -= dp[i - 1][j - 1];
      dp[i][j] %= MOD;
      if (i > 0) dp[i][j] += dp[i - 1][j];
      dp[i][j] %= MOD;
      if (j > 0) dp[i][j] += dp[i][j - 1];
      dp[i][j] %= MOD;
    }
  }
  return dp[n][m];
}
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;
}
