#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 100;
int s[N], t[N];
long long dp[N][N];
int mod = 1e9 + 7;
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> s[i];
  for (int j = 1; j <= m; j++) cin >> t[j];
  for (int i = 0; i <= n; i++) dp[i][0] = 1;
  for (int i = 0; i <= m; i++) dp[0][i] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - 1]) % mod;
      if (s[i] == t[j]) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1] + mod) % mod;
    }
  }
  printf("%lld\n", dp[n][m]);
  return 0;
}
