#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
};
void phongbeo();
const int inf = 1e18;
const int mod2 = 1e9 + 7;
const int mod1 = 998244353;
int add(int x,int y)
{
if(x+y>=mod2) x-=mod2;
return x+y;
}
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
ll n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root;
int kk;
int el = 19;
main()
{
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
NHP
/// cin>>s1;
///modwwe
phongbeo();
// checktime
}
vector<int> c[100001];
map<pair<int,int>,bool> cnt;
int a[100001];
int b[100001];
unordered_map<int,int> cost[100001];
int f[100001];
int ask[1000001];
int bit[100001];
void upd(int x)
{
for(x; x; x-=x&-x) bit[x]++;
}
int get(int x)
{
int s=0;
for(x; x<=n; x+=x&-x)s+=bit[x];
return s;
}
void setup()
{
s4=0;
for(int i=1; i<=n; i++)
{
s4+=get(a[i]);
upd(a[i]-1);
}
}
bool check(int x,int y)
{
if(f[x]>f[y]) return 0;
if(f[x]==f[y]&&x>y)return 0;
return 1;
}
void phongbeo()
{
cin>>n>>k>>m;
for(int i=1; i<=n; i++)
cin>>a[i];
for(int i=1; i<=k; i++)
b[i]=i;
for(int i=1;i<=n;i++)
{
f[a[i]]++;
}
for(int i=1; i<=m; i++)
{
cin>>ask[i];
l=ask[i];
s2=b[l];
s3=b[l+1];
if(!check(s2,s3))swap(s2,s3);
if(!cnt[{s2,s3}])
c[s2].pb(s3),cnt[{s2,s3}]=1;
swap(b[l],b[l+1]);
}
for(int i=1;i<=k;i++)
f[i]=0;
for(int i=1; i<=n; i++)
{
for(auto x:c[a[i]])
{
cost[a[i]][x]+=f[x];
}
f[a[i]]++;
}
for(int i=1; i<=k; i++)
b[i]=i;
setup();
for(int i=1; i<=m; i++)
{
l=ask[i];
s2=b[l];
s3=b[l+1];
swap(b[l],b[l+1]);
if(check(s2,s3))s4=s4-1ll*cost[s2][s3]*2+1ll*f[s2]*f[s3];
else {
swap(s2,s3);
s4=s4+1ll*cost[s2][s3]*2-1ll*f[s2]*f[s3];
}
cout<<s4,down
}
}
