Bird Attack

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<deque>
using namespace std;

int main()
{
    vector<int> output;
    int N;
    cin >> N;
    deque<int > q;
    int Number;
    for(int i=0;i<N;i++)
    {
        cin >> Number;
        q.push_back(Number);
    }

    int M;
    cin >> M;
    vector<int> v;
    for(int i=0;i<M;i++)
    {
        cin >> Number;
        v.push_back(Number);
    }

    sort(v.begin(),v.end());
    int ar[1000];
    for(int i=0;i<v.size();i++)
        ar[v[i]]=v[i];

    for(int i=1;!q.empty();i++)
    {
        if(i==ar[i])
        {
            q.push_back(q.front());
            q.pop_front();
        }
        else
        {
            output.push_back(q.front());
            q.pop_front();
        }
    }
    for(int j=0;j<output.size();j++)
        cout << output[j] << endl;
    exit(EXIT_SUCCESS);
}