#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll HIGHINF = (ll)1e18;
const ll LOWINF = (ll)1e15;
const long double PI = 3.1415926535897932384626433;

template<typename T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template<typename... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

template<typename T> 
struct BIT2D{
  int n,m;
  T d,mod;
  vector<vector<T> > bit;
  //1-indexed
  BIT2D():n(-1),m(-1){}
  BIT2D(int n_,int m_,T d_, T mod):n(n_),m(m_),d(d_),mod(mod),bit(n_+1,vector<T>(m+1,d_)){}
  T sum(int i,int j){
    T s=d;
    for(int x=i;x>0;x-=(x&-x))
      for(int y=j;y>0;y-=(y&-y)){
        s+=bit[x][y];
        if(s>=mod) s -= mod;
      }
    return s;
  }
  void add(int i,int j,T a){
    if(i==0||j==0) return;
    for(int x=i;x<=n;x+=(x&-x))
      for(int y=j;y<=m;y+=(y&-y)){
            bit[x][y]+=a;
            if(bit[x][y]>=mod) bit[x][y] -= mod;
      }
  }
  // (x1,x2] * (y1,y2];
  T sum(int x1,int y1,int x2,int y2){
        T res = sum(x1,y1);
        res -= sum(x1,y2);
        if(res<0) res += mod;
        res -= sum(x2,y1);
        if(res<0) res += mod;
        res += sum(x2,y2);
        if(res>=mod) res -= mod;
        return res;
  }
};

int main() {
    ll N,M; cin >> N >> M;
    V<ll> S(N+1,0);
    for(int i = 1; i <= N; ++i) cin >> S[i];

    V<ll> T(M+1,0);
    for(int i = 1; i <= M; ++i) cin >> T[i];

    V<V<ll>> a(N+2,V<ll>(M+2,0));
    for(int i = 1; i <= N; ++i){
        for(int j = 1; j <= M; ++j){
            a[i][j] = (S[i]==T[j]);
        }
    }

    BIT2D<ll> bit(N+2,M+2,0,MOD);
    for(int i = 1; i <= N; ++i){
        for(int j = 1; j <= M; ++j){
            bit.add(i,j,a[i][j]);
        }
    }

    ll ans = 1;
    for(int i = 1; i <= N; ++i){
        for(int j = 1; j <= M; ++j){
            if(!a[i][j]) continue;
            ll val = bit.sum(0,0,i-1,j-1);
            ans += (val + 1)%MOD;
            if(ans>=MOD) ans -= MOD;
            bit.add(i,j,val);
        }
    }

    cout << ans << endl; 
 
    return 0;
}


Measured memory_bytes: 64256