#include <bits/stdc++.h>

using namespace std;

signed main() {
    int n, m, q; scanf("%d%d%d", &n, &m, &q);
    vector<int> a(n), s(m + 1), cnt(m);
    vector< vector<int> > pos(m);
    long long res = 0;
    int id = 0;
    for (auto &x : a) {
        scanf("%d", &x), ++cnt[--x], pos[x].push_back(id++);
        for (int i = x + 2; i <= m; i += i & -i) res += s[i];
        for (int i = x + 1; i; i -= i & -i) ++s[i];
    }
    vector<int> per(m);
    iota(per.begin(), per.end(), 0);
    map< pair<int, int>, long long> M;
    auto query = [&](int x, int y) {
        if (!cnt[x] || !cnt[y]) return 0ll;
        int ty = (cnt[x] > cnt[y]);
        if (cnt[x] > cnt[y]) swap(x, y);
        long long S = 0;
        if (M.count({x, y})) S = M[{x, y}];
        else {
            for (auto v : pos[x]) S += lower_bound(pos[y].begin(), pos[y].end(), v) - pos[y].begin();
            M[{x, y}] = S;
        }
        if (ty) S = 1ll * cnt[x] * cnt[y] - S;
        return S;
    };
    while (q--) {
        int x; scanf("%d", &x);
        res += 1ll * cnt[per[x - 1]] * cnt[per[x]] - 2 * query(per[x - 1], per[x]);
        swap(per[x - 1], per[x]);
        printf("%lld\n", res);
    }
    return 0;
}