#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

int main() {
    int n, q;
    cin >> n >> q;
    
    vector<int> cars(n);
    for (int i = 0; i < n; i++) {
        cin >> cars[i];
    }
    
    unordered_map<int, int> overtakes;
    int max_overtakes = 0, most_overtaken = -1;
    
    for (int i = 0; i < q; i++) {
        int overtaken_car;
        cin >> overtaken_car;
        
        int overtaking_car = cars[overtaken_car-2];
        
        overtakes[overtaking_car]++;
        if (overtakes[overtaking_car] > max_overtakes || 
            (overtakes[overtaking_car] == max_overtakes && overtaking_car < most_overtaken)) {
            max_overtakes = overtakes[overtaking_car];
            most_overtaken = overtaking_car;
        }
        
        cars.erase(cars.begin() + overtaken_car - 1);
        cars.insert(cars.begin() + overtaken_car - 2, overtaking_car);
        
        cout << most_overtaken << endl;
    }
    
    return 0;
}