#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll op(ll a, ll b) { return min(a, b); }

ll e() { return 10000000023LL; }

int main() {
    ll N, Q;
    cin >> N >> Q;
    vector<ll> A(N);
    vector<ll> B(Q);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    for (ll i = 0; i < Q; i++) {
        cin >> B[i];
    }
    // seg1:
    segtree<ll, op, e> seg1(N);
    segtree<ll, op, e> seg2(N);
    seg1.set(0, 0);
    seg2.set(0, N - 1);
    for (ll i = 0; i < Q; i++) {
        segtree<ll, op, e> seg3(N);
        segtree<ll, op, e> seg4(N);
        for (ll j = 0; j < N; j++) {
            if (B[i] == A[j]) {
                ll val1 = seg1.prod(j, N) - j;
                ll val2 = seg2.prod(0, j) - (N - 1 - j);
                if (val1 > val2) {
                    seg3.set(j, val2 + j);
                    seg4.set(j, val2 + (N - 1 - j));
                } else {
                    seg3.set(j, val1 + j);
                    seg4.set(j, val1 + (N - 1 - j));
                }
            }
        }
        /*for (ll j = 0; j < N; j++) {
            cout << seg3.get(j) << " ";
        }
        cout << endl;
        for (ll j = 0; j < N; j++) {
            cout << seg4.get(j) << " ";
        }
        cout << endl;*/
        for (ll j = 0; j < N; j++) {
            ll val = min(seg3.get(j) - j, seg4.get(j) - (N - 1 - j));
            seg1.set(j, val + j);
            seg2.set(j, val + (N - 1 - j));
        }
    }
    ll ans = 10000000023;
    for (ll i = 0; i < N; i++) {
        ans = min(ans, seg1.get(i) - i);
    }
    cout << ans << endl;
}