#include <bits/stdc++.h>
using namespace std;
long long dp[2002][2002];
int main(void) {
  int n, m;
  cin >> n >> m;
  vector<int> ss;
  vector<int> ts;
  for (int i = 0; i < n; i++) {
    int st;
    cin >> st;
    ss.push_back(st);
  }
  for (int i = 0; i < m; i++) {
    int tt;
    cin >> tt;
    ts.push_back(tt);
  }
  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] -
                 (ss[i - 1] != ts[j - 1] ? dp[i - 1][j - 1] : 0);
      dp[i][j] %= 1000000007;
    }
  cout << dp[n][m] << endl;
  return 0;
}
