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