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