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