/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author tatsumack
 */

#include <iostream>
#include <fstream>

#include <iostream>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>

#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#include <unordered_map>
#include <unordered_set>

#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)

using namespace std;

typedef pair<int, int> P;

int mod = 1e9 + 7;
struct mint {
    unsigned x; mint() : x(0) { }
    mint(signed sig) { x = sig < 0 ? sig % mod + mod : sig % mod; }
    mint(signed long long sig) { x = sig < 0 ? sig % mod + mod : sig % mod; }
    int get() const { return (int)x; }
    mint &operator+=(mint that) { if ((x += that.x) >= mod) x -= mod; return *this; }
    mint &operator-=(mint that) { if ((x += mod - that.x) >= mod) x -= mod; return *this; }
    mint &operator*=(mint that) { x = (unsigned long long)x * that.x % mod; return *this; }
    mint &operator/=(mint that) { return *this *= that.inverse(); }
    mint operator+(mint that) const { return mint(*this) += that; }
    mint operator-(mint that) const { return mint(*this) -= that; }
    mint operator*(mint that) const { return mint(*this) *= that; }
    mint operator/(mint that) const { return mint(*this) /= that; }
    mint inverse() const {
        long long a = x, b = mod, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return mint(u);
    }
    bool operator==(mint that) const { return x == that.x; }
    bool operator!=(mint that) const { return x != that.x; }
    mint operator-() const { mint t; t.x = x == 0 ? 0 : mod - x; return t; }
};

mint dp[2005][2005];

class ECommonSubsequence {
public:
    static constexpr int kStressIterations = 0;

    static void generateTest(std::ostream& test) {
    }

    void solve(std::istream& cin, std::ostream& cout) {
        int N, M;
        cin >> N >> M;
        vector<int> S(N), T(M);
        REP(i, N) cin >> S[i];
        REP(i, M) cin >> T[i];

        dp[0][0] = 1;
        REP(i, N) {
            dp[i+1][0] = dp[i][0];
        }
        REP(j, M) {
            dp[0][j+1] = dp[0][j];
        }
        REP(i, N) {
            REP(j, M) {
                dp[i+1][j+1] = dp[i+1][j] + dp[i][j+1] - dp[i][j];
                if (S[i] == T[j]) {
                    dp[i+1][j+1] += dp[i][j];
                }
            }
        }
        REP(i, N+1) {
            REP(j, M+1) {
                //DUMP(i)
                //DUMP(j)
                //DUMP(dp[i][j].get())
            }
        }
        cout << dp[N][M].get() << endl;
    }
};


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    std::istream& in(std::cin);
    std::ostream& out(std::cout);

    ECommonSubsequence solver;
    solver.solve(in, out);
    return 0;
}


Measured memory_bytes: 16000