#include <bits/stdc++.h>
using namespace std;
const int maxn = 2 * 1000 + 10;
const long long mod = 1e9 + 7;
long long dp[maxn][maxn];
long long a[maxn], b[maxn];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) cin >> b[i];
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (a[i] == b[j])
        dp[i][j] = 1 + dp[i - 1][j - 1] + dp[i - 1][j] + dp[i][j - 1] -
                   dp[i - 1][j - 1];
      else
        dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1];
      dp[i][j] %= mod;
    }
  }
  cout << dp[n][m] + 1;
  return 0;
}
