#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

constexpr int I_INF = (1 << 30);
constexpr ll L_INF = (1ll << 62);

//==================================

template <std::int_fast64_t Modulus>
class ModInt {
    using i64 = std::int_fast64_t;

    // friend
    template <std::int_fast64_t _MOD>
    friend std::ostream& operator<<(std::ostream& os, const ModInt<_MOD>& rhs);

private:
    i64 a;

public:
    /**
     * コンストラクタ
     */
    constexpr ModInt(const i64 x = 0) noexcept : a(x % Modulus) {}

    constexpr i64& value() noexcept { return a; }
    constexpr const i64& value() const noexcept { return a; }

    constexpr ModInt operator+(const ModInt& rhs) const noexcept {
        return ModInt(*this) += rhs;
    }
    constexpr ModInt operator-(const ModInt& rhs) const noexcept {
        return ModInt(*this) -= rhs;
    }
    constexpr ModInt operator*(const ModInt& rhs) const noexcept {
        return ModInt(*this) *= rhs;
    }
    constexpr ModInt operator/(const ModInt& rhs) const noexcept {
        return ModInt(*this) /= rhs;
    }

    constexpr ModInt& operator+=(const ModInt rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }
    constexpr ModInt& operator-=(const ModInt rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr ModInt& operator*=(const ModInt rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr ModInt& operator/=(ModInt rhs) noexcept {
        i64 exp = Modulus - 2;
        while (exp) {
            if (exp & 1) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp >>= 1;
        }
        return *this;
    }

    constexpr ModInt& operator++() noexcept {
        *this += 1;
        return *this;
    }
    constexpr ModInt operator++(int) noexcept {
        ModInt res = *this;
        *this += 1;
        return res;
    }
    constexpr ModInt& operator--() noexcept {
        *this -= 1;
        return *this;
    }
    constexpr ModInt operator--(int) noexcept {
        ModInt res = *this;
        *this -= 1;
        return res;
    }

    constexpr bool operator<(const ModInt& rhs) const noexcept {
        return a < rhs.a;
    }
    constexpr bool operator>(const ModInt& rhs) const noexcept {
        return a > rhs.a;
    }
    constexpr bool operator<=(const ModInt& rhs) const noexcept {
        return a <= rhs.a;
    }
    constexpr bool operator>=(const ModInt& rhs) const noexcept {
        return a >= rhs.a;
    }
    constexpr bool operator==(const ModInt& rhs) const noexcept {
        return a == rhs.a;
    }

    constexpr ModInt pow(i64 k) const noexcept {
        ModInt res = 1;
        ModInt tmp = *this;
        for (; k > 0; k >>= 1) {
            if (k & 1) res *= tmp;
            tmp *= tmp;
        }
        return res;
    }

    constexpr ModInt inverse() const noexcept {
        i64 q = a;
        i64 b = Modulus, u = 1, v = 0;
        while (b) {
            i64 t = q / b;
            q -= t * b;
            swap(q, b);
            u -= t * v;
            swap(u, v);
        }
        u %= Modulus;
        if (u < 0) u += Modulus;
        return u;
    }
};

// ModIntでcoutするための関数
template <std::int_fast64_t Modulus>
std::ostream& operator<<(std::ostream& os, const ModInt<Modulus>& rhs) {
    os << rhs.a;
    return os;
}

constexpr ll MOD = (ll)(1e9 + 7);

ModInt<MOD> dp0[2010][2010], dp1[2010][2010];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, M;
    cin >> N >> M;
    Vi S(N + 1), T(M + 1);
    for (int i = 0; i < N; ++i) {
        cin >> S[i];
    }
    for (int i = 0; i < M; ++i) {
        cin >> T[i];
    }

    dp0[0][0] = 1;
    for (int i = 0; i <= N; ++i) {
        for (int j = 0; j <= M; ++j) {
            dp0[i + 1][j] += dp0[i][j];
            dp1[i][j] += dp0[i][j];
            dp1[i][j + 1] += dp1[i][j];
            if (S[i] == T[j]) {
                dp0[i + 1][j + 1] += dp1[i][j];
            }
        }
    }

    cout << dp1[N][M] << endl;

    return 0;
}

Measured memory_bytes: 63232