1511C.cpp

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct Node
{
    int data;
    Node *next;
    Node *prev;

    Node(int d) : data(d), next(nullptr), prev(nullptr) {}
};

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, q;
    cin >> n >> q;

    vector<int> a(n);
    vector<int> queries(q);

    Node *head = nullptr;
    Node *tail = nullptr;

    for (int i = 0; i < n; i++)
    {
        int key;
        cin >> key;
        Node *node = new Node(key);
        if (!head)
        {
            head = tail = node;
        }
        else
        {
            tail->next = node;
            node->prev = tail;
            tail = node;
        }
    }

    for (int i = 0; i < q; i++)
    {
        cin >> queries[i];
    }

    for (int i = 0; i < q; i++)
    {
        int key = queries[i];
        Node *temp = head;
        int ind = 1;
        while (temp && temp->data != key)
        {
            temp = temp->next;
            ind++;
        }

        if (!temp)
            continue;

        queries[i] = ind;

        if (temp == head)
            continue;

        if (temp->prev)
            temp->prev->next = temp->next;
        if (temp->next)
            temp->next->prev = temp->prev;
        if (temp == tail)
            tail = temp->prev;

        temp->prev = nullptr;
        temp->next = head;
        if (head)
            head->prev = temp;
        head = temp;
    }

    for (int i = 0; i < q; i++)
    {
        cout << queries[i] << ' ';
    }
    cout << '\n';

    while (head)
    {
        Node *next = head->next;
        delete head;
        head = next;
    }

    return 0;
}