#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
long long n, m;
vector<vector<long long>> dp(2020, vector<long long>(2020, 0));
int main() {
  cin >> n >> m;
  vector<long long> s(n), t(m);
  for (int i = 0; i < n; i++) cin >> s[i];
  for (int i = 0; i < m; i++) cin >> t[i];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (s[i] == t[j]) {
        dp[i + 1][j + 1] = (dp[i][j + 1] + dp[i + 1][j] + 1) % 1000000007;
      } else {
        dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j] - dp[i][j];
      }
    }
  }
  cout << (dp[n][m] + 1) % 1000000007 << endl;
  return 0;
}
