#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e3 + 10;
const int INF = 0x3f3f3f3f;
const long long LLINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
const int LOGN = 20;
int s[MAXN];
int t[MAXN];
long long dp[MAXN][MAXN];
signed main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", &s[i]);
  for (int i = 1; i <= m; ++i) scanf("%d", &t[i]);
  for (int i = 0; i <= m; ++i) dp[0][i] = 1;
  for (int i = 0; i <= n; ++i) dp[i][0] = 1;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      if (s[i] != t[j])
        dp[i][j] = (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]) % MOD;
      else
        dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % MOD;
    }
  }
  printf("%lld\n", dp[n][m]);
  return 0;
}
