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