#include <bits/stdc++.h>
using namespace std;
const long long MOD_CONST = 1000000007;
const int INF = 1000000000;
const long long BIG_NUM = 1000000000000000000;
int main() {
  int n, m;
  cin >> n >> m;
  vector<int> s(n);
  vector<int> t(m);
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> t[i];
  }
  vector<vector<long long>> dp(n + 1, vector<long long>(m + 1));
  dp[0][0] = 1;
  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++) {
      if (s[i - 1] == t[j - 1]) {
        dp[i][j] = (dp[i - 1][j - 1]) % MOD_CONST;
      } else {
        dp[i][j] = 0;
      }
      dp[i][j] = (dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + dp[i][j]) %
                 MOD_CONST;
    }
  }
  cout << dp[n][m] << endl;
}
