#include<bits/stdc++.h>
using namespace std;
const int N=2e3+10;
const int MOD=1e9+7;
int n,m,a[N],b[N],dp[N][N];

int main()
{
	cin>>n>>m;
	for (int i=1;i<=n;i++) scanf("%d",&a[i]);
	for (int i=1;i<=m;i++) scanf("%d",&b[i]);
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++) {
			dp[i][j]=((dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1])%MOD+MOD)%MOD;
			if (a[i]==b[j]) dp[i][j]=(dp[i][j]+dp[i-1][j-1]+1)%MOD;
		} 
	cout<<(dp[n][m]+1)%MOD<<endl;	
	return 0;
}