#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cmath>

 #include <algorithm>

 #define maxn 200001

 using namespace std;

 typedef long long ll;

 ll ans[maxn],Ans;

 int n,m,tot,tsum[maxn],num[maxn],pos[maxn],sum[maxn],_num[maxn];

 bool bo[maxn];

 struct date{

     int bo,id,x,y;

 }qs[maxn],temp[maxn];

 int lowbit(int x){

     return x&(-x);

 }

 void insert(int x,int y){

     for (int i=x;i<=n;i+=lowbit(i)) sum[i]+=y;

 }

 int qsum(int x){

     int tmp=; for (int i=x;i;i-=lowbit(i)) tmp+=sum[i];

     return tmp;

 }

 void tinsert(int x){

     for (int i=x;i<=n;i+=lowbit(i)) tsum[i]++;

 }

 int tqsum(int x){

     int tmp=;

     for (int i=x;i>;i-=lowbit(i)){

         tmp+=tsum[i];

     }

     return tmp;

 }

 bool comp(date x,date y){

     return x.x<y.x;

 }

 bool comp2(date x,date y){

     return x.id<y.id;

 }

 void cdq_solve(int l,int r){

     if (l==r) return;

     int mid=(l+r)/,tmp=; cdq_solve(l,mid),cdq_solve(mid+,r);

     sort(qs+l,qs+mid+,comp),sort(qs+mid+,qs+r+,comp);

     for (int i=l,j=mid+;j<=r;){

         for (;i<=mid&&qs[i].bo==;i++);

         for (;j<=r&&qs[j].bo==;j++);

         if (j>r) break;

         if (qs[i].x<qs[j].x&&i<=mid) insert(qs[i].y,),tmp=i++;

         else ans[qs[j].id]+=qsum(qs[j].y-),j++;

     }

     for (int i=l;i<=tmp;i++) if (qs[i].bo==) insert(qs[i].y,-);

 }

 int main(){

 //    freopen("dtnxd.in","r",stdin);

 //    freopen("dtnxd.out","w",stdout);

     int u,v;

     memset(sum,,sizeof(sum));

     memset(tsum,,sizeof(tsum)),Ans=;

     memset(bo,,sizeof(bo));

     memset(ans,,sizeof(ans));

     scanf("%d%d",&n,&m),tot=;

     for (int i=;i<=n;i++) scanf("%d",&u),pos[u]=i,_num[i]=u;

     for (int i=m;i>=;i--) scanf("%d",&num[i]),bo[pos[num[i]]]=;

     for (int i=n;i>=;i--){

         if (bo[i]==){

             Ans+=tqsum(_num[i]-);

             tinsert(_num[i]);

         }

     }

     for (int i=;i<=n;i++){

         if (!bo[i]) u=_num[i],++tot,qs[tot].bo=,qs[tot].x=u,qs[tot].y=i,qs[tot].id=tot;

     }

     for (int i=;i<=m;i++){

         u=num[i],v=pos[u];

         qs[++tot].bo=,qs[tot].x=u,qs[tot].y=v,qs[tot].id=tot;

         qs[++tot].bo=,qs[tot].x=u,qs[tot].y=v,qs[tot].id=tot;

     }

 //    for (int i=1;i<=tot;i++) printf("%d %d %d %d\n",qs[i].x,qs[i].y,qs[i].bo,qs[i].id);

     for (int i=;i<=tot;i++){

         temp[i]=qs[i];

         qs[i].x=n+-qs[i].x;

     }

     cdq_solve(,tot);

     for (int i=;i<=tot;i++){

         qs[i]=temp[i];

         qs[i].y=n+-qs[i].y;

     }

     cdq_solve(,tot);

     sort(qs+,qs+tot+,comp2);

 //    for (int i=1;i<=tot;i++) printf("%d %lld\n",i,ans[i]);

     for (int i=;i<=tot;i++) ans[i]+=ans[i-];

     for (int i=tot;i>;i--) if (qs[i].bo==) printf("%lld\n",ans[i]+Ans);

     return ;

 }