#include <bits/stdc++.h>
using namespace std;
const long long N = 2e3 + 100, MOD = 1e9 + 7;
long long dp[N][N], a[N], b[N];
long long n, m;
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  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 = 0; i < N; i++) dp[i][0] = dp[0][i] = 1;
  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] +
                  (a[i] == b[j]) * dp[i - 1][j - 1]) %
                 MOD;
  return cout << dp[n][m], 0;
}
