#include <bits/stdc++.h>
using namespace std;
long long dp[2005][2005];
int main(int argc, char *argv[]) {
  int n, m;
  cin >> n >> m;
  vector<int> 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 + 1][j] + dp[i][j + 1] + 1) % 1000000007;
      } else {
        dp[i + 1][j + 1] =
            (dp[i + 1][j] + dp[i][j + 1] - dp[i][j]) % 1000000007;
      }
    }
  }
  cout << (dp[n][m] + 1) % 1000000007 << endl;
  return 0;
}
