//#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <cmath>
#include <map>

using namespace std;
int main(){
    int n,m;
    cin >> n >> m;
    vector<int> s(n),t();
    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,0));
    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=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(s[i]==t[j]){
                dp[i+1][j+1]=(dp[i][j+1]+dp[i+1][j])%1000000007;;
            }
            else{
                dp[i+1][j+1]=(dp[i][j+1]+dp[i+1][j]-dp[i][j]+1000000007)%1000000007;
            }
        }
    }
    cout << dp[n][m] << endl;
}