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