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