#include <bits/stdc++.h>
using namespace std;
int s[10005], t[10005];
int n, m;
void sovle() {
  vector<vector<int> > dp(n + 1, vector<int>(m + 1, 0));
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (s[i - 1] == t[j - 1]) {
        dp[i][j] = (dp[i - 1][j] % 1000000007 + dp[i][j - 1] % 1000000007 + 1) %
                   1000000007;
      } else
        dp[i][j] = (dp[i - 1][j] % 1000000007 + dp[i][j - 1] % 1000000007 -
                    dp[i - 1][j - 1] % 1000000007 + 1000000007) %
                   1000000007;
    }
  }
  cout << (dp[n][m] + 1) % 1000000007 << endl;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> s[i];
  ;
  for (int i = 0; i < m; i++) cin >> t[i];
  ;
  sovle();
  return 0;
}
