#include <bits/stdc++.h>
using namespace std;
 
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e9
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
template<class T>void show(vector<T>v){for (int i = 0; i < v.size(); i++){cerr<<v[i]<<" ";}cerr<<"\n";}
typedef long long ll;
ll dsp[2100][2100];
signed main(){
    int n,m;
    cin>>n>>m;
    vector<int>s(n),t(m);
    ll MOD=1e9+7;
    for (int i = 0; i < n; i++)
    {
        cin >> s[i];
    }
    for (int i = 0; i < m; i++)
    {
        cin >> t[i];
    }
    //vector<vector<ll>>dp(n+1,vector<ll>(m+1,0));
    memset(dp,0,sizeof(dp));
    vector<vector<ll>>sdp(n+1,vector<ll>(m+1,0));
    dp[0][0]=1;
    for (int i = 0; i <=n; i++)
    {
        for (int j = 0; j <=m; j++)
        {
            if(s[i-1]==t[j-1] && i-1>=0 && j-1>=0) dp[i][j]+=(dp[i-1][j-1])%MOD;
            if(i-1>=0)  dp[i][j]+=(dp[i-1][j])%MOD;
            if(j-1>=0)  dp[i][j]+=(dp[i][j-1])%MOD;
            if(i-1>=0 && j-1>=0) dp[i][j]-=dp[i-1][j-1];
            dp[i][j]%=MOD;
        }   
        
    }
  /*  for (int i = 0; i <= n; i++)
    {
        for (int j = 0; j <= m; j++)
        {
            cout<<dp[i][j]<<" ";
        }
        cout<<endl;
        
    }*/
    
    cout<<dp[n][m]%MOD<<endl;
    
    return 0;
}