#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
long long max3(long long x, long long y, long long z) {
  return max(max(x, y), z);
}
long long min3(long long x, long long y, long long z) {
  return min(min(x, y), z);
}
const long long M = 2e5 + 10, M2 = 1e6 + 10, mod = 1e9 + 7, inf = 1e17 + 10;
void add(int& a, int b) {
  a += b;
  if (a >= mod) {
    a -= mod;
  }
}
int X[] = {0, 1, 0, -1};
int Y[] = {-1, 0, 1, 0};
long long power(long long x, long long n) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % mod;
    x = ((x % mod) * (x % mod)) % mod;
    n = n / 2;
  }
  return result;
}
long long dp[1001][1001];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n >> m;
  long long s[n + 1], t[m + 1];
  for (long long i = 1; i < n + 1; i++) cin >> s[i];
  for (long long i = 1; i < m + 1; i++) cin >> t[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];
      if (s[i] == t[j]) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1] + 1);
      dp[i][j] %= mod;
    }
  }
  cout << (dp[n][m] + 1) % mod;
  return 0;
}
