#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;
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];
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1;
  if (s[0] == t[0]) dp[0][0]++;
  for (int i = 0; i < (n); i++) {
    for (int j = 0; j < (n); j++) {
      if (i == 0 && j == 0) continue;
      if (i == 0) {
        if (s[i] == t[j])
          dp[i][j] = dp[i][j - 1] + 1;
        else
          dp[i][j] = dp[i][j - 1];
        continue;
      } else if (j == 0) {
        if (s[i] == t[j])
          dp[i][j] = dp[i - 1][j] + 1;
        else
          dp[i][j] = dp[i - 1][j];
        continue;
      }
      if (i > 0) dp[i][j] += dp[i - 1][j];
      dp[i][j] %= MOD;
      if (j > 0) dp[i][j] += dp[i][j - 1];
      dp[i][j] %= MOD;
      if (s[i] != t[j] && i > 0 && j > 0) dp[i][j] -= dp[i - 1][j - 1];
      dp[i][j] %= MOD;
    }
  }
  cout << dp[n - 1][m - 1] << endl;
}
