#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
  for (size_t i = 0; i < n; i++) {
    for (size_t j = 0; j < n; j++) {
      for (size_t k = 0; k < n; k++) {
        dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
      }
    }
  }
}
class UnionFind {
 public:
  vector<ll> Parent;
  UnionFind(ll N) { Parent = vector<ll>(N, -1); }
  ll find(ll A) {
    if (Parent[A] < 0) return A;
    return Parent[A] = find(Parent[A]);
  }
  ll size(ll A) { return -Parent[find(A)]; }
  bool Union(ll A, ll B) {
    A = find(A);
    B = find(B);
    if (A == B) {
      return false;
    }
    if (size(A) < size(B)) swap(A, B);
    Parent[A] += Parent[B];
    Parent[B] = A;
    return true;
  }
};
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
  ll g = gcd(a, b);
  return a / g * b;
}
ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }
ll powMod(ll a, ll p) {
  if (p == 0) {
    return 1;
  } else if (p % 2 == 0) {
    ll half = powMod(a, p / 2);
    return mulMod(half, half);
  } else {
    return mulMod(powMod(a, p - 1), a);
  }
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
ll dp[2010][2010];
void solve(long long N, long long M, std::vector<long long> S,
           std::vector<long long> T) {
  dp[0][0] = 1;
  for (int i = 0; i <= N; i++) {
    dp[i][0] = 1;
  }
  for (int j = 0; j <= M; j++) {
    dp[0][j] = 1;
  }
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= M; j++) {
      ll cnt = 0;
      for (int k = j; k <= M; k++) {
        if (S[i - 1] == T[k - 1]) {
          cnt++;
        }
      }
      if (S[i - 1] == T[j - 1]) {
        dp[i][j] = (dp[i][j - 1] + dp[i][j - 1]) % MOD;
      } else {
        dp[i][j] = (dp[i][j - 1] + cnt) % MOD;
      }
    }
    dp[i + 1][0] = dp[i][M];
  }
  cout << dp[N][M] << endl;
}
int main() {
  long long N;
  scanf("%lld", &N);
  long long M;
  scanf("%lld", &M);
  std::vector<long long> S(N);
  for (int i = 0; i < N; i++) {
    scanf("%lld", &S[i]);
  }
  std::vector<long long> T(M);
  for (int i = 0; i < M; i++) {
    scanf("%lld", &T[i]);
  }
  solve(N, M, std::move(S), std::move(T));
  return 0;
}
