#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long dp[3000][3000];
long long a[3000], b[3000];
int32_t main() {
  freopen("in", "r", stdin);
  freopen("out", "w", stdout);
  long long n, m;
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 1; i <= m; i++) cin >> b[i];
  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]) % mod;
      dp[i][j] += mod;
      dp[i][j] %= mod;
      if (a[i] == b[j]) {
        dp[i][j] = (1 + dp[i - 1][j - 1] + dp[i][j]) % mod;
      }
    }
  cout << (dp[n][m] + 1) % mod;
}
