#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const int mod = 1e9 + 7;
int n, m;
long long dp[2050][2050];
int a[2050], b[2050];
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
  dp[0][0] = dp[1][0] = dp[0][1] = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      if (a[i] == b[j])
        dp[i][j] = (dp[i - 1][j] + dp[i][j - 1] + 1) % mod;
      else
        dp[i][j] = (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]) % mod;
    }
  cout << (dp[n][m] + 1) % mod << endl;
}
