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