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