#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
const int MOD = 1e9 + 7;
const int INF = 2000000000;
const long long INFLL = 1LL * INF * INF;
int a[N], b[N];
int dp[N][N];
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) cin >> b[i];
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % MOD;
      dp[i][j] = (dp[i][j] - dp[i - 1][j - 1] + MOD) % MOD;
      if (a[i] == b[j]) {
        dp[i][j] = (dp[i][j] + 1 + dp[i - 1][j - 1]) % MOD;
      }
    }
  }
  cout << (dp[n][m] + 1) % MOD << '\n';
  return 0;
}
