// Előzések.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <vector>
int find(int val, std::vector<int> vec)
{
    int i = 0;
    while (i < vec.size() && val != vec[i])
        i++;
    return i == vec.size() ? -1 : i;
}
int main()
{
    int N, Q;
    std::vector<int> sorrend;
    std::vector<int> elozesrend;
    std::cin >> N >> Q;
    int* elozesek = new int[N];

    for (int i = 0; i < N; i++)
    {
        int temp;
        std::cin >> temp;
        sorrend.push_back(temp);
        elozesek[i] = 0;
    }
    
    for (int i = 0; i < Q; i++)
    {
        int temp;
        std::cin >> temp;
        elozesrend.push_back(temp);
    }
    int maxi = 0;
    for (int i = 0; i < Q; i++)
    {
        //megelozi
        int ind = find(elozesrend[i], sorrend);
        int temp = sorrend[ind];
        sorrend[ind] = sorrend[ind - 1];
        sorrend[ind - 1] = temp;
        int megelozott = sorrend[ind];
        elozesek[megelozott]++;
        if (elozesek[maxi] < elozesek[megelozott])
            maxi = megelozott;
        else if (elozesek[maxi] == elozesek[megelozott])
            maxi = maxi > megelozott ? megelozott : maxi;
        //valasz
        std::cout << maxi << std::endl;
    }
    for (int i = 0; i < N; i++)
        std::cout << elozesek[i];
    //delete[] elozesek;
}