#include <bits/stdc++.h>
using namespace std;
int n, m, a[3010], b[3010], dp[3010][3010];
int main() {
  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 = 0; i <= n; i++) dp[i][0] = 1;
  for (int i = 1; i <= m; i++) dp[0][i] = 1;
  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]) % 1000000007;
      else
        dp[i][j] =
            (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]) % 1000000007;
  cout << dp[n][m] << endl;
  return 0;
}
