#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
inline void Yes(bool condition) {
  if (condition)
    cout << "Yes"
         << "\n";
  else
    cout << "No"
         << "\n";
}
template <class itr>
void cins(itr first, itr last) {
  for (auto i = first; i != last; i++) {
    cin >> (*i);
  }
}
template <class itr>
void array_output(itr start, itr goal) {
  string ans = "", k = " ";
  for (auto i = start; i != goal; i++) ans += to_string(*i) + k;
  if (!ans.empty()) ans.pop_back();
  cout << ans << "\n";
}
ll gcd(ll a, ll b) { return a ? gcd(b % a, a) : b; }
const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MAX = 20000;
constexpr ll nx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
constexpr ll ny[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n, m;
  cin >> n >> m;
  vector<ll> s(n), t(m);
  cins((s).begin(), (s).end());
  cins((t).begin(), (t).end());
  vector<vector<ll>> dp(n + 1, vector<ll>(m + 1, 0));
  for (ll i = ll(0); i < ll(n + 1); ++i) dp[i][0] = 1;
  for (ll i = ll(0); i < ll(m + 1); ++i) dp[0][i] = 1;
  for (ll i = ll(1); i < ll(n + 1); ++i) {
    for (ll j = ll(1); j < ll(m + 1); ++j) {
      if (s[i - 1] == t[j - 1]) {
        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] << "\n";
}
