#include <bits/stdc++.h>
using namespace std;
long long s[2000];
long long t[2000];
long long dp[2001][2001] = {};
int main() {
  int n, m;
  cin >> n >> 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++) dp[i][0] = 1;
  for (int j = 0; j <= m; j++) dp[0][j] = 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      dp[i + 1][j + 1] =
          dp[i][j + 1] + dp[i + 1][j] - dp[i][j] + dp[i][j] * (s[i] == t[j]);
      dp[i + 1][j + 1] %= 1000000007;
    }
  }
  cout << dp[n][m] << endl;
}
