#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

using namespace std;

const int maxn = 1e5 + 5;

struct fwt {
    int l[maxn];
    int (*merge)(int, int);

    fwt(int (*f)(int, int)) {
        merge = f;
    }

    void update(int x, int val) {
        for (; x < maxn; x += (x & -x)) {
            l[x] = merge(l[x], val);
        }
    }

    int query(int x) {
        int sol = 0;
        for (; x; x -= (x & -x)) {
            sol = merge(sol, l[x]);
        }
        return sol;
    }
};

int add(int x, int y) {
    return x + y;
}

int maks(int x, int y) {
    return max(x, y);
}

fwt dv(add), dps(add), active(add), compute(maks);
bool akt[maxn];
set<pair<int, int>> curr;
int a[maxn], pos[maxn];
int erased[maxn];
int queries[maxn];
vector<int> sw[maxn];

int calc(int x) {
    int val = a[x] - dv.query(a[x]);
    int ind = x - dps.query(x);
    return ind - val;
}

int main() {
    int n, q;
    cin >> n >> q;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        pos[a[i]] = i;
        erased[i] = n + 1;
    }

    for (int i = 1; i <= q; i++) {
        cin >> queries[i];
        erased[a[queries[i]]] = i;
    }

    int val;

    for (int i = 1; i <= n; i++) {
        val = compute.query(n + 1 - pos[i]);

        if (val < erased[i]) {
            sw[val].push_back(pos[i]);
            sw[erased[i]].push_back(-pos[i]);
            compute.update(n + 1 - pos[i], erased[i]);
        }
    }

    long long sol = 0;

    for (int i = 0; i <= q; i++) {
        if (i) {
            if (!akt[queries[i]]) {
                auto it = curr.lower_bound({a[queries[i]], 0});
                it--;
                sol -= active.query(it->second) - active.query(queries[i]);
            }

            dv.update(a[queries[i]], 1);
            dps.update(queries[i], 1);
        }

        for (int x : sw[i]) {
            if (x < 0) {
                akt[-x] = 0;
                curr.erase({a[-x], -x});
                active.update(-x, -1);
                sol -= calc(-x);
            } else {
                akt[x] = 1;
                curr.insert({a[x], x});
                active.update(x, 1);
                sol += calc(x);
            }
        }

        cout << sol + n - i << " ";
    }

    cout << endl;
    return 0;
}