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