#include <bits/stdc++.h>
using namespace std;
long long a, b, c;
const long long maxn = 200005;
const long long mod = 1e9 + 7;
long long num[100005];
long long n, k, m;
long long sum[100005];
long long s[2005], t[2005];
long long dp[2005][2005];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0);
  while (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 = 0; i <= n; i++)
      for (int j = 0; j <= m; j++) dp[i][j] = 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] = ((1 + dp[i][j - 1]) % mod + dp[i - 1][j]) % mod;
        } else {
          dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - 1]) % mod;
        }
      }
    }
    cout << (dp[n][m] + 1) % mod << "\n";
  }
}
