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

#define int long long


struct fenwick {
	vector<int> tree;
	fenwick(int n):tree(n+1){};
	void add(int k,int x){
		while(k<tree.size()){
			tree[k]+=x;
			k+=k&-k;
		}
	}
	int get(int k){
		int ans = 0;
		while(k){
			ans+=tree[k];
			k-=k&-k;
		}
		return ans;
	}
};

int32_t main(){
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	int n,q;
	cin >> n >> q;
	vector<int> a(n+1);
	vector<int> rev(n+1);
	for(int i=1;i<=n;i++){
		cin>>a[i];
		rev[a[i]]=i;
	}
	vector<int> queries(q);
	for(int&i:queries)cin>>i;
	int ans = 0;
	set<int> curr,curra;
	reverse(queries.begin(),queries.end());
	fenwick activePpl(n);
	fenwick activeSpecial(n);
	fenwick addedSpecial(n);
	vector<bool> present(n+1,true);
	auto add = [&](int x){
		ans++;
		present[x]=true;
		activePpl.add(x,1);
		// case 1: if it isn't a good one
		auto upiter = curr.upper_bound(x);
		if(upiter!=curr.end() and a[*upiter]<a[x]){
			auto iter = curra.upper_bound(a[x]);
			int idx = n;
			if(iter!=curra.end())idx=rev[*iter]-1;
			ans+=activeSpecial.get(idx)-activeSpecial.get(x);
			addedSpecial.add(x,1);
			addedSpecial.add(idx+1,-1);
			return;
		}
		// Case 2: it's a good one
		activeSpecial.add(x,1);
		// TODO: Fix
		{
			int offset = addedSpecial.get(x);
			addedSpecial.add(x,-offset);
			addedSpecial.add(x+1,+offset);
		}
		int pre = 0;
		for(int i=1;i<x;i++){
			if(present[i] and a[i]>a[x])pre++;
		}
		ans+=pre;
		addedSpecial.add(x,pre);
		addedSpecial.add(x+1,-pre);
		auto iter = curr.insert(x).first; 
		curra.insert(a[x]);
		while(iter!=curr.begin()){
			if(a[*--iter]>a[x]){
				ans-=addedSpecial.get(*iter);
				activeSpecial.add(*iter,-1);
				curra.erase(a[*iter]);
				iter = curr.erase(iter);
			}
		}
	};
	{
		for(int&i:queries)present[i]=false;
		for(int i=1;i<=n;i++)if(present[i])add(i);
	}
	vector<int> answers = {ans};
	for(int&i:queries){
		add(i);
		answers.emplace_back(ans);
	}
	reverse(answers.begin(),answers.end());
	for(int&i:answers)cout<<i<<' ';
	cout << '\n';
}