#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("-ffloat-store")
using namespace std;
const double PI = acos(-1.0);
clock_t time_p = clock();
void amit() {
  time_p = clock() - time_p;
  cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
const long long int INF = 0xFFFFFFFFFFFFFFFL;
long long int seed;
mt19937 rng(seed = chrono::steady_clock::now().time_since_epoch().count());
inline long long int rnd(long long int l = 0, long long int r = INF) {
  return uniform_int_distribution<long long int>(l, r)(rng);
}
class CMP {
 public:
  bool operator()(pair<long long int, long long int> a,
                  pair<long long int, long long int> b) {
    return !(a.first < b.first || a.first == b.first && a.second <= b.second);
  }
};
void add(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt == m.end())
    m.insert({x, cnt});
  else
    jt->second += cnt;
}
void del(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt->second <= cnt)
    m.erase(jt);
  else
    jt->second -= cnt;
}
bool cmp(const pair<long long int, long long int> &a,
         const pair<long long int, long long int> &b) {
  return a.first < b.first || (a.first == b.first && a.second < b.second);
}
const long long int mod = 1000000007L;
const long long int MXN = 10000L;
long long int CommomSubsequencesCount(vector<long long int> s,
                                      vector<long long int> t) {
  int n1 = s.size();
  int n2 = t.size();
  long long int dp[n1 + 1][n2 + 1];
  memset(dp, (0), sizeof(dp));
  for (int i = 1; i <= n1; i++) {
    for (int j = 1; j <= n2; j++) {
      if (s[i - 1] == t[j - 1])
        dp[i][j] = (1 + dp[i][j - 1] + dp[i - 1][j]) % 1000000007;
      else
        dp[i][j] =
            (dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - 1] + 1000000007) %
            1000000007;
    }
  }
  return dp[n1][n2];
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  int m;
  cin >> m;
  vector<long long int> s(n, 0);
  for (int i = 0; i < n; i += 1) {
    cin >> s[i];
  };
  vector<long long int> t(n, 0);
  for (int i = 0; i < n; i += 1) {
    cin >> t[i];
  };
  cout << (CommomSubsequencesCount(s, t) + 1) % 1000000007 << endl;
  return 0;
}
