#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    int n, q;
    std::cin >> n >> q;

    std::vector<int> cars(n);
    for (int i = 0; i < n; i++) {
        std::cin >> cars[i];
    }

    std::vector<int> freq(n+1, 0);
    int most_frequent = 1;
    for (int i = 1; i < n; i++) {
        if (cars[i] < cars[i-1]) {
            std::swap(cars[i], cars[i-1]);
            freq[cars[i]]++;
            if (freq[cars[i]] > freq[most_frequent] || (freq[cars[i]] == freq[most_frequent] && cars[i] < most_frequent)) {
                most_frequent = cars[i];
            }
        }
    }

    for (int i = 0; i < q; i++) {
        int x;
        std::cin >> x;
        std::swap(cars[x-1], cars[x-2]);
        freq[cars[x-1]]++;
        freq[cars[x-2]]++;
        if (freq[cars[x-1]] > freq[most_frequent] || (freq[cars[x-1]] == freq[most_frequent] && cars[x-1] < most_frequent)) {
            most_frequent = cars[x-1];
        }
        if (freq[cars[x-2]] > freq[most_frequent] || (freq[cars[x-2]] == freq[most_frequent] && cars[x-2] < most_frequent)) {
            most_frequent = cars[x-2];
        }
        std::cout << most_frequent << std::endl;
    }

    return 0;
}