#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
int main() {
  ll n, m;
  cin >> n >> m;
  vector<ll> s(n + 1), t(m + 1);
  for (ll i = 1; i <= n; i++) cin >> s[i];
  for (ll i = 1; i <= m; i++) cin >> t[i];
  vector<vector<ll>> dp(n + 1, vector<ll>(m + 1)),
      sum(n + 1, vector<ll>(m + 1));
  for (ll i = 0; i <= n; i++) dp[i][0] = 1;
  for (ll j = 0; j <= m; j++) dp[0][j] = 1;
  for (ll i = 1; i <= n; i++) {
    for (ll j = 1; j <= m; j++) {
      if (s[i] == t[j]) {
        sum[i][j] = dp[i - 1][j - 1];
      }
      dp[i][j] =
          (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + sum[i][j]) % MOD;
    }
  }
  cout << dp[n][m] << endl;
}
