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