#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline void chmin(T1 &a, T2 b) {
  if (a > b) a = b;
}
template <typename T1, typename T2>
inline void chmax(T1 &a, T2 b) {
  if (a < b) a = b;
}
const long long MOD = 1000000007;
signed 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 + 1][m + 1];
  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 {
        dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % MOD;
        if (s[i - 1] != t[j - 1]) dp[i][j] -= dp[i - 1][j - 1];
        dp[i][j] %= MOD;
      }
    }
  }
  cout << dp[n][m] << endl;
}
