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