#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
using vpl = vector<pl>;
using vvpl = vector<vpl>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  ll n, m;
  cin >> n >> m;
  vl s(n), t(m);
  for (ll i = 0; i < n; i++) cin >> s[i];
  for (ll i = 0; i < m; i++) cin >> t[i];
  vvl dp(n + 1, vl(m + 1, 1));
  for (ll i = 0; i < n + 1; i++) {
    if (i == n) continue;
    for (ll j = 0; j < m + 1; j++) {
      if (j == m) continue;
      if (s[i] == t[j]) {
        dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j];
        dp[i + 1][j + 1] %= MOD;
      } else {
        dp[i + 1][j + 1] = dp[i + 1][j] + dp[i][j + 1] - dp[i][j];
        dp[i + 1][j + 1] %= MOD;
      }
    }
  }
  cout << dp[n][m] << endl;
}
