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