#include <bits/stdc++.h>
using namespace std;
long long dp[2003][2003], n, m, s[2003], t[2003];
const long long MOD = 1000000007;
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> s[i + 1];
  for (int i = 0; i < m; i++) cin >> t[i + 1];
  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 - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]) % MOD;
      if (s[i] == t[j]) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1]) % MOD;
    }
  cout << dp[n][m];
}
