#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const int mod = 1e9 + 7;
const int maxn = 1e5;

void solve() {
    int n, m;
    cin >> n >> m;
    // mistaking n, m ?
    vector<int> a(1 + n, 0);
    vector<int> b(1 + m, 0);
    vector<int> v(1, 0);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        v.pb(a[i]);
    }
    for(int i = 1; i <= m; i++) {
        cin >> b[i];
        v.pb(b[i]);
    }
    sort(v.begin(), v.end());
    v.resize(unique(v.begin(), v.end()) - v.begin());
    for(int i = 1; i <= n; i++) {
        a[i] = (int) (lower_bound(v.begin(), v.end(), a[i]) - v.begin());
    }
    for(int i = 1; i <= m; i++) {
        b[i] = (int) (lower_bound(v.begin(), v.end(), b[i]) - v.begin());
    }
    // all elements between 1 and n+m<=2e5
    /*for(int i = 1; i <= n; i++) {
        cout << a[i] << " ";
    }
    cout << "\n";
    for(int i = 1; i <= m; i++) {
        cout << b[i] << " ";
    }
    cout << "\n";*/
    vector<vector<pair<int, int> > > intervals(1 + 2 * maxn);
    for(int l = 1; l <= n; l++) {
        int maxi = 0;
        for(int r = l; r <= n; r++) {
            maxi = max(maxi, a[r]);
            intervals[maxi].pb(mp(l, r));
        }
    }
    vector<int> dp;
    dp.assign(1 + n, 0);
    dp[0] = 1;
    for(int i = 1; i <= m; i++) {
        vector<int> new_dp(1 + n, 0);
        for(pair<int, int> p : intervals[b[i]]) {
            new_dp[p.se] = (new_dp[p.se] + dp[p.fi - 1]) % mod;
        }
        dp = new_dp;
    }
    cout << dp[n] << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}