#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define PLL pair<LL, LL>

#define PLI pair<LL, int>

#define PII pair<int, int>

#define SZ(x) ((int)x.size())

#define ull unsigned long long

using namespace std;

const int N =  + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = ;

const double eps = 1e-;

const double PI = acos(-);

int n, m;

int p[N], c[N];

int d, match[N];

bool vis[N];

bool ban[N];

vector<int> person;

vector<int> G[N];

vector<int> ans;

int path(int u) {

    for(auto& v : G[u]) {

        if(!vis[v]) {

            vis[v] = true;

            if(match[v] == - || path(match[v])) {

                match[v] = u;

                return ;

            }

        }

    }

    return ;

}

int main() {

    memset(match, -, sizeof(match));

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

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

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

    scanf("%d", &d);

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

        int who; scanf("%d", &who);

        ban[who] = true;

        person.push_back(who);

    }

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

        if(ban[i]) continue;

        G[p[i]].push_back(c[i]);

    }

    for(int i = SZ(person) - , j = ; i >= ; i--) {

        while() {

            memset(vis, , sizeof(vis));

            if(path(j)) j++;

            else break;

        }

        int x = person[i];

        ans.push_back(j);

        G[p[x]].push_back(c[x]);

    }

    reverse(ans.begin(), ans.end());

    for(auto& x : ans) printf("%d\n", x);

    return ;

}

/*

*/